<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chenhan233的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chenhan233</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chenhan233]]></copyright><item><title><![CDATA[[leetcode]Backtracking-39. Combination Sum]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049540</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049540</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:40:56 +0800</pubDate><description><![CDATA[Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all
 unique combinations in C where the candidate numbers sums to T. 

The same repeated number may be chosen]]></description><category></category></item><item><title><![CDATA[[leetcode]Two Pointers-344. Reverse String]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049532</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049532</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:38:43 +0800</pubDate><description><![CDATA[Write a function that takes a string as input and returns the string reversed.

Example:
Given s = "hello", return "olleh".char* reverseString(char* s) {
2     assert(s != NULL);
3     int len= str]]></description><category></category></item><item><title><![CDATA[[leetcode]Binary Search-35. Search Insert Position]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049517</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049517</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:36:36 +0800</pubDate><description><![CDATA[Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.]]></description><category></category></item><item><title><![CDATA[[leetcode]Depth-first Search-695. Max Area of Island]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049510</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049510</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:35:00 +0800</pubDate><description><![CDATA[Given a non-empty 2D array grid of 0's and 1's, an island is
 a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You
 may assume all four edges of the grid are su]]></description><category></category></item><item><title><![CDATA[[leetcode]Tree-669. Trim a Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049500</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049500</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:32:47 +0800</pubDate><description><![CDATA[Given a binary search tree and the lowest and highest boundaries as L and R,
 trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change
 the root of the tree, so the r]]></description><category></category></item><item><title><![CDATA[[leetcode] Hash Table-760. Find Anagram Mappings]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049493</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049493</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:30:58 +0800</pubDate><description><![CDATA[Given two lists Aand B,
 and B is an anagram of A. B is
 an anagram of A means B is
 made by randomizing the order of the elements in A.
We want to find an index mapping P, from A to B.
 A mappin]]></description><category></category></item><item><title><![CDATA[[leetcode]Math-413. Arithmetic Slices]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049485</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049485</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:28:35 +0800</pubDate><description><![CDATA[A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
For example, these are arithmetic sequence:]]></description><category></category></item><item><title><![CDATA[[leetcode]String-696. Count Binary Substrings]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049473</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049473</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:26:22 +0800</pubDate><description><![CDATA[Give a string s, count the number of non-empty (contiguous) substrings that have the same
 number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively. 

Su]]></description><category></category></item><item><title><![CDATA[[leetcode]Dynamic Programming-121. Best Time to Buy and Sell Stock]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049458</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049458</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:22:41 +0800</pubDate><description><![CDATA[Say you have an array for which the ith element is the price of a given stock on day i.
If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), d]]></description><category></category></item><item><title><![CDATA[[leetcode]Array-697. Degree of an Array]]></title><link>https://blog.youkuaiyun.com/chenhan233/article/details/79049441</link><guid>https://blog.youkuaiyun.com/chenhan233/article/details/79049441</guid><author>chenhan233</author><pubDate>Sat, 13 Jan 2018 09:18:34 +0800</pubDate><description><![CDATA[Given a non-empty array of non-negative integers nums, the degree of
 this array is defined as the maximum frequency of any one of its elements.

Your task is to find the smallest possible length o]]></description><category></category></item></channel></rss>