<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sinat_14867719的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sinat_14867719</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sinat_14867719]]></copyright><item><title><![CDATA[LeetCode题解–226. Invert Binary Tree]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/73863357</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/73863357</guid><author>sinat_14867719</author><pubDate>Wed, 28 Jun 2017 19:43:13 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/invert-binary-tree/ 
难度：Easy题目
  Invert a binary tree.
分析这题比较简单，利用分治的想法就能翻转二叉树。代码class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        i]]></description><category></category></item><item><title><![CDATA[LeetCode题解–215. Kth Largest Element in an Array]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/73549191</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/73549191</guid><author>sinat_14867719</author><pubDate>Wed, 21 Jun 2017 14:54:43 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/kth-largest-element-in-an-array/难度：Medium题目
  Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order,]]></description><category></category></item><item><title><![CDATA[LeetCode题解–260. Single Number III]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/73287528</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/73287528</guid><author>sinat_14867719</author><pubDate>Thu, 15 Jun 2017 14:45:15 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/single-number-iii/难度：Medium题目
  Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice]]></description><category></category></item><item><title><![CDATA[算法概论习题证明]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/72917697</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/72917697</guid><author>sinat_14867719</author><pubDate>Thu, 08 Jun 2017 14:42:59 +0800</pubDate><description><![CDATA[题目8.8. In the EXACT 4SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four literals, and such that each variable occurs at most once in each clause. The goal is to]]></description><category></category></item><item><title><![CDATA[LeetCode题解–207. Course Schedule]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/72903593</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/72903593</guid><author>sinat_14867719</author><pubDate>Wed, 07 Jun 2017 20:32:17 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/course-schedule/难度：Medium题目
  There are a total of n courses you have to take, labeled from 0 to n - 1. 
   Some courses may have prerequisites, for example t]]></description><category></category></item><item><title><![CDATA[LeetCode题解–134. Gas Station]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/72835028</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/72835028</guid><author>sinat_14867719</author><pubDate>Thu, 01 Jun 2017 20:40:24 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/gas-station/难度：Medium题目
  There 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 unlimite]]></description><category></category></item><item><title><![CDATA[LeetCode题解–143. Reorder List]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/72675469</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/72675469</guid><author>sinat_14867719</author><pubDate>Wed, 24 May 2017 13:27:45 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/minimum-window-substring/难度：Hard题目
  Given a singly linked list L: L0→L1→…→Ln-1→Ln, 
  reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… 
  You must do this in-place wit]]></description><category></category></item><item><title><![CDATA[LeetCode题解–200. Number of Islands]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/72467621</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/72467621</guid><author>sinat_14867719</author><pubDate>Thu, 18 May 2017 14:42:08 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/number-of-islands/难度：Medium题目
  Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is form]]></description><category></category></item><item><title><![CDATA[LeetCode题解–131. Palindrome Partitioning]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/71621128</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/71621128</guid><author>sinat_14867719</author><pubDate>Thu, 11 May 2017 13:37:16 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/palindrome-partitioning/难度：Medium题目
  Given a string s, partition s such that every substring of the partition is a palindrome.
题目大意是给定一个字符串，返回所有子串是回文串的划分情况。比]]></description><category></category></item><item><title><![CDATA[LeetCode题解–135. Candy]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/71171825</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/71171825</guid><author>sinat_14867719</author><pubDate>Thu, 04 May 2017 16:23:15 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/candy/难度：Hard题目
  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]]></description><category></category></item><item><title><![CDATA[LeetCode题解–130. Surrounded Regions]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/70856031</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/70856031</guid><author>sinat_14867719</author><pubDate>Thu, 27 Apr 2017 15:19:56 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/surrounded-regions/难度：Medium题目
  Given a 2D board containing ‘X’ and ‘O’ (the letter O), capture all regions surrounded by ‘X’. 
  A region is captured by fli]]></description><category></category></item><item><title><![CDATA[LeetCode题解–137. Word Break]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/70239575</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/70239575</guid><author>sinat_14867719</author><pubDate>Wed, 19 Apr 2017 13:55:18 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/word-break/难度：Medium题目
  Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a spa]]></description><category></category></item><item><title><![CDATA[LeetCode题解–137. Single Number II]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/70158516</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/70158516</guid><author>sinat_14867719</author><pubDate>Thu, 13 Apr 2017 15:32:13 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/single-number-ii/难度：Medium题目
  Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one.]]></description><category></category></item><item><title><![CDATA[LeetCode题解–72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/69389457</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/69389457</guid><author>sinat_14867719</author><pubDate>Thu, 06 Apr 2017 14:40:15 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/edit-distance/难度：Hard题目
  Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as]]></description><category></category></item><item><title><![CDATA[LeetCode题解–55. Jump Game]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/68487319</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/68487319</guid><author>sinat_14867719</author><pubDate>Thu, 30 Mar 2017 14:58:01 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/jump-game/难度：Medium题目
  Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).]]></description><category></category></item><item><title><![CDATA[LeetCode题解–76. Minimum Window Substring]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/65449198</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/65449198</guid><author>sinat_14867719</author><pubDate>Thu, 23 Mar 2017 21:07:13 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/minimum-window-substring/难度：Hard题目
  Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(]]></description><category></category></item><item><title><![CDATA[LeetCode题解–120. Triangle]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/62043821</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/62043821</guid><author>sinat_14867719</author><pubDate>Tue, 14 Mar 2017 15:24:14 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/triangle/难度：Medium题目
  Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. 
  For exa]]></description><category></category></item><item><title><![CDATA[LeetCode题解–133. Clone Graph]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/60965297</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/60965297</guid><author>sinat_14867719</author><pubDate>Thu, 09 Mar 2017 18:56:40 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/clone-graph/难度：Medium题目
  Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.
该无向图结点包含的信息有整数标签和一个保存所有邻接结点的vector。考]]></description><category></category></item><item><title><![CDATA[LeetCode题解–46. Permutations]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/59807754</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/59807754</guid><author>sinat_14867719</author><pubDate>Fri, 03 Mar 2017 01:06:27 +0800</pubDate><description><![CDATA[链接LeetCode题目：https://leetcode.com/problems/permutations难度：Medium题目
  Given a collection of distinct numbers, return all possible permutations.
简单来说，此题的目的是计算n个相异数的所有可能的排列情况。分析这题不算很难，为了得到n个数字的排列，可以先把第1个数]]></description><category></category></item><item><title><![CDATA[LeetCode题解–4. Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/sinat_14867719/article/details/56741083</link><guid>https://blog.youkuaiyun.com/sinat_14867719/article/details/56741083</guid><author>sinat_14867719</author><pubDate>Fri, 24 Feb 2017 01:06:10 +0800</pubDate><description><![CDATA[LeetCode题解–4. Median of Two Sorted Arrays]]></description><category></category></item></channel></rss>