<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dijun0013的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dijun0013</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dijun0013]]></copyright><item><title><![CDATA[class 03 Reorder Linked List]]></title><link>https://blog.youkuaiyun.com/dijun0013/article/details/101198931</link><guid>https://blog.youkuaiyun.com/dijun0013/article/details/101198931</guid><author>dijun0013</author><pubDate>Thu, 12 Apr 2018 11:56:00 +0800</pubDate><description><![CDATA[class 03 Reorder Linked List

        
	
        
            

    
 1   public ListNode reorder(ListNode head) {
 2     // Write your solution here
 3     if (head == ...]]></description><category></category></item><item><title><![CDATA[Class 03 Insert in sorted linked list]]></title><link>https://blog.youkuaiyun.com/dijun0013/article/details/101198928</link><guid>https://blog.youkuaiyun.com/dijun0013/article/details/101198928</guid><author>dijun0013</author><pubDate>Thu, 12 Apr 2018 06:17:00 +0800</pubDate><description><![CDATA[Class 03 Insert in sorted linked list

        
	
        
            

    
 1   public ListNode insert(ListNode head, int value) {
 2     // Write your solution here
...]]></description><category></category></item><item><title><![CDATA[LeetCode 25: Reverse Nodes in k-Group]]></title><link>https://blog.youkuaiyun.com/dijun0013/article/details/101198935</link><guid>https://blog.youkuaiyun.com/dijun0013/article/details/101198935</guid><author>dijun0013</author><pubDate>Sun, 25 Mar 2018 08:21:00 +0800</pubDate><description><![CDATA[LeetCode 25: Reverse Nodes in k-Group

        
	
        
            

    https://leetcode.com/problems/reverse-nodes-in-k-group/description/
Given a linked list, rever...]]></description><category></category></item><item><title><![CDATA[Binary Search 中几道 Rotated sorted array题目的整理]]></title><link>https://blog.youkuaiyun.com/dijun0013/article/details/101198919</link><guid>https://blog.youkuaiyun.com/dijun0013/article/details/101198919</guid><author>dijun0013</author><pubDate>Sun, 25 Mar 2018 04:40:00 +0800</pubDate><description><![CDATA[Binary Search 中几道 Rotated sorted array题目的整理

        
	
        
            

    总结放前面:
BS 找 Rotated sorted array 的题目目前接触到的共四道: 33, 81, 153, 154. 两道找find target, 两道find ...]]></description><category></category></item><item><title><![CDATA[merge sort]]></title><link>https://blog.youkuaiyun.com/dijun0013/article/details/101198916</link><guid>https://blog.youkuaiyun.com/dijun0013/article/details/101198916</guid><author>dijun0013</author><pubDate>Sun, 11 Mar 2018 10:00:00 +0800</pubDate><description><![CDATA[merge sort

        
	
        
            

    Q: Given an array of integers, sort the elements in the array in ascending order. The merge sort algorithm should be used ...]]></description><category></category></item><item><title><![CDATA[a to the power of b]]></title><link>https://blog.youkuaiyun.com/dijun0013/article/details/101198932</link><guid>https://blog.youkuaiyun.com/dijun0013/article/details/101198932</guid><author>dijun0013</author><pubDate>Sun, 11 Mar 2018 09:51:00 +0800</pubDate><description><![CDATA[a to the power of b

        
	
        
            

    
 1 public class Solution {
 2   public long power(int a, int b) {
 3     // Write your solution here
 4     ...]]></description><category></category></item></channel></rss>