<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Johnkui技术博客]]></title><description><![CDATA[坚持坚持]]></description><link>https://blog.youkuaiyun.com/Johnkui</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Johnkui]]></copyright><item><title><![CDATA[[LeetCode]19. Remove Nth Node From End of List]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51176121</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51176121</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 22:28:59 +0800</pubDate><description><![CDATA[19. Remove Nth Node From End of List
  Given a linked list, remove the nth node from the end of list and return its head.
For example,Given linked list: 1->2->3->4->5, and n = 2.After removing the seco]]></description><category></category></item><item><title><![CDATA[[LeetCode]61. Rotate List]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51175522</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51175522</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 21:22:36 +0800</pubDate><description><![CDATA[61. Rotate List
  Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.分析链表旋转问题，不像数组容易知道数组长度，链表只]]></description><category></category></item><item><title><![CDATA[[LeetCode]82. Remove Duplicates from Sorted List II]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51175111</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51175111</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 20:26:40 +0800</pubDate><description><![CDATA[82. Remove Duplicates from Sorted List II
  Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3]]></description><category></category></item><item><title><![CDATA[[LeetCode]80. Remove Duplicates from Sorted Array II]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51174237</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51174237</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 17:36:50 +0800</pubDate><description><![CDATA[80. Remove Duplicates from Sorted Array II
  Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given sorted array nums = [1,1,1,2,2,3],Your functio]]></description><category></category></item><item><title><![CDATA[[LeetCode]83. Remove Duplicates from Sorted List]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51174196</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51174196</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 17:30:34 +0800</pubDate><description><![CDATA[83. Remove Duplicates from Sorted List
  Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return]]></description><category></category></item><item><title><![CDATA[[LeetCode]86. Partition List]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51174091</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51174091</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 17:09:31 +0800</pubDate><description><![CDATA[86. Partition List
  Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. 
  You should preserve the original relative order of]]></description><category></category></item><item><title><![CDATA[[LeetCode] 92. Reverse Linked List II]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51173737</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51173737</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 16:14:49 +0800</pubDate><description><![CDATA[92. Reverse Linked List II
  Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.Note:
Given]]></description><category></category></item><item><title><![CDATA[[LeetCode]206. Reverse Linked List]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51173102</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51173102</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 14:10:44 +0800</pubDate><description><![CDATA[206. Reverse Linked List
  Reverse a singly linked list. A linked list can be reversed either iteratively or recursively. Could you implement both?
分析翻转链表可以通过迭代方式也可以通过递归方式。递归方式主要是确定递归退出条件，当head为空时返回空，当]]></description><category></category></item><item><title><![CDATA[[LeetCode]2. Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51172898</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51172898</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 13:23:53 +0800</pubDate><description><![CDATA[2. Add Two Numbers
  You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and]]></description><category></category></item><item><title><![CDATA[[LeetCode]137. Single Number II]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51172608</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51172608</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 12:09:16 +0800</pubDate><description><![CDATA[137. Single Number II
  Given an array of integers, every element appears three times except for one. Find that single one.
Note: 
Your algorithm should have a linear runtime complexity. Could you impl]]></description><category></category></item><item><title><![CDATA[[LeetCode]136. Single Number]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51172394</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51172394</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 11:28:38 +0800</pubDate><description><![CDATA[136. Single Number
  Given an array of integers, every element appears twice except for one. Find that single one.
Note: 
Your algorithm should have a linear runtime complexity. Could you implement it]]></description><category></category></item><item><title><![CDATA[[LeetCode]135. Candy]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51172316</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51172316</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 11:15:16 +0800</pubDate><description><![CDATA[135. Candy
  There are N children standing in a line. Each child is assigned a rating value. 
  You are giving candies to these children subjected to the following requirements: 
  Each child must have]]></description><category></category></item><item><title><![CDATA[[LeetCode]134. Gas Station]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51172077</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51172077</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 10:33:58 +0800</pubDate><description><![CDATA[134. Gas Station
  here are N gas stations along a circular route, where the amount of gas at station i is gas[i]. 
  You have a car with an unlimited gas tank and it costs cost[i] of gas to travel fro]]></description><category></category></item><item><title><![CDATA[[LeetCode]73. Set Matrix Zeroes]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51171881</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51171881</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 09:59:27 +0800</pubDate><description><![CDATA[73. Set Matrix Zeroes
  Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
Follow up:
Did you use extra space?
A straight forward solution using O(mn) space i]]></description><category></category></item><item><title><![CDATA[[LeetCode]89. Gray Code]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51171327</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51171327</guid><author>Johnkui</author><pubDate>Sun, 17 Apr 2016 00:57:55 +0800</pubDate><description><![CDATA[89. Gray Code
  The gray code is a binary numeral system where two successive values differ in only one bit. 
  Given a non-negative integer n representing the total number of bits in the code, print t]]></description><category></category></item><item><title><![CDATA[[LeetCode]70. Climbing Stairs]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51171075</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51171075</guid><author>Johnkui</author><pubDate>Sat, 16 Apr 2016 23:29:47 +0800</pubDate><description><![CDATA[70. Climbing Stairs
  You are climbing a stair case. It takes n steps to reach to the top. 
  Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
分析题目要求给出爬到]]></description><category></category></item><item><title><![CDATA[[LeetCode]66. Plus One]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51170923</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51170923</guid><author>Johnkui</author><pubDate>Sat, 16 Apr 2016 23:00:03 +0800</pubDate><description><![CDATA[66. Plus One
  Given a non-negative number represented as an array of digits, plus one to the number. 
  The digits are stored such that the most significant digit is at the head of the list.
分析一个非负整数的]]></description><category></category></item><item><title><![CDATA[[LeetCode]48. Rotate Image]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51170803</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51170803</guid><author>Johnkui</author><pubDate>Sat, 16 Apr 2016 22:41:02 +0800</pubDate><description><![CDATA[48. Rotate Image
  You are given an n x n 2D matrix representing an image. 
  Rotate the image by 90 degrees (clockwise). 
  Follow up: 
  Could you do this in-place?
分析题目要求将一个n x n 的二维矩阵进行顺时针90度旋转，直接思]]></description><category></category></item><item><title><![CDATA[[LeetCode]189. Rotate Array]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51170307</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51170307</guid><author>Johnkui</author><pubDate>Sat, 16 Apr 2016 21:30:40 +0800</pubDate><description><![CDATA[189. Rotate Array
  Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].分析题目需要旋转一个数组，使得右边的k个元素不变序的搬到数组头部。]]></description><category></category></item><item><title><![CDATA[[LeetCode]42. Trapping Rain Water]]></title><link>https://blog.youkuaiyun.com/Johnkui/article/details/51169755</link><guid>https://blog.youkuaiyun.com/Johnkui/article/details/51169755</guid><author>Johnkui</author><pubDate>Sat, 16 Apr 2016 19:53:12 +0800</pubDate><description><![CDATA[42. Trapping Rain Water
  Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
For example, 
Given [0,1]]></description><category></category></item></channel></rss>