<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ysCover]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/CriminalCode</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; CriminalCode]]></copyright><item><title><![CDATA[lintcode 427. 生成括号]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/82110935</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/82110935</guid><author>CriminalCode</author><pubDate>Mon, 27 Aug 2018 13:25:58 +0800</pubDate><description><![CDATA[                                                             427. 生成括号

题目：

描述

给定 n 对括号，请写一个函数以将其生成新的括号组合，并返回所有组合结果。

您在真实的面试中是否遇到过这个题？  是

样例

给定 n = 3, 可生成的组合如下:

&quot;((()))&quot;, &quot;(()())&quot;, &quot;(())()&quot;, &quot;()...]]></description><category></category></item><item><title><![CDATA[LintCode 69. 二叉树的层次遍历]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/80353570</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/80353570</guid><author>CriminalCode</author><pubDate>Thu, 17 May 2018 17:12:56 +0800</pubDate><description><![CDATA[69. 二叉树的层次遍历描述给出一棵二叉树，返回其节点值的层次遍历（逐层从左往右访问）样例给一棵二叉树 {3,9,20,#,#,15,7} ：  3
 / \
9  20
  /  \
 15   7
返回他的分层遍历结果：[
  [3],
  [9,20],
  [15,7]
]
挑战挑战1：只使用一个队列去实现它挑战2：用DFS算法来做题目链接：https://www.lintcode.com...]]></description><category></category></item><item><title><![CDATA[LintCode 67. 二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/80350392</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/80350392</guid><author>CriminalCode</author><pubDate>Thu, 17 May 2018 15:04:50 +0800</pubDate><description><![CDATA[67. 二叉树的中序遍历描述给出一棵二叉树,返回其中序遍历样例给出二叉树 {1,#,2,3},   1
    \
     2
    /
   3返回 [1,3,2]题目链接：https://www.lintcode.com/problem/binary-tree-inorder-traversal/description解题思路1：（递归）递归得到左子树的中序遍历的vector数组，把当前结...]]></description><category></category></item><item><title><![CDATA[Leetcode 91. Decode Ways (string)]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79494001</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79494001</guid><author>CriminalCode</author><pubDate>Fri, 09 Mar 2018 10:59:59 +0800</pubDate><description><![CDATA[91. Decode Ways


A message containing letters from A-Z is being encoded
 to numbers using the following mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26

Given an encoded message containing digits, det]]></description><category></category></item><item><title><![CDATA[Leetcode 74. Search a 2D Matrix]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79438320</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79438320</guid><author>CriminalCode</author><pubDate>Sun, 04 Mar 2018 18:19:45 +0800</pubDate><description><![CDATA[74. Search a 2D Matrix


Write an efficient algorithm that searches for a value in an m x 
n matrix. This matrix has the following properties:


Integers in each row are sorted from left to rig]]></description><category></category></item><item><title><![CDATA[Leetcode 45. Jump Game II(dp)]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79430034</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79430034</guid><author>CriminalCode</author><pubDate>Sat, 03 Mar 2018 14:58:34 +0800</pubDate><description><![CDATA[45. Jump Game II


Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that posi]]></description><category></category></item><item><title><![CDATA[Leetcode 48. Min Cost Climbing Stairs]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79425240</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79425240</guid><author>CriminalCode</author><pubDate>Fri, 02 Mar 2018 17:24:47 +0800</pubDate><description><![CDATA[48. Min Cost Climbing Stairs

 On a staircase, the i-th step has some non-negative cost
cost[i] assigned (0 indexed).
Once you pay the cost, you can either climb one or two steps. You need to find]]></description><category></category></item><item><title><![CDATA[Leetcode 62. Unique Paths]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79422385</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79422385</guid><author>CriminalCode</author><pubDate>Fri, 02 Mar 2018 13:55:25 +0800</pubDate><description><![CDATA[62. Unique Paths


A robot is located at the top-left corner of a 
m x n grid (marked 'Start' in the diagram below).
The robot can only move either down or right at any point in time. The robot i]]></description><category></category></item><item><title><![CDATA[Leetcode 51. N-Queens]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79417544</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79417544</guid><author>CriminalCode</author><pubDate>Thu, 01 Mar 2018 21:34:43 +0800</pubDate><description><![CDATA[51. N-Queens


The n-queens puzzle is the problem of placing n queens on an
n×n chessboard such that no two queens attack each other.

Given an integer n, return all distinct solutions to the n-]]></description><category></category></item><item><title><![CDATA[Leetcode 55. Jump Game]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79413466</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79413466</guid><author>CriminalCode</author><pubDate>Thu, 01 Mar 2018 16:08:58 +0800</pubDate><description><![CDATA[55. Jump Game


Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that positio]]></description><category></category></item><item><title><![CDATA[Leetcode 53. Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79251716</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79251716</guid><author>CriminalCode</author><pubDate>Sun, 04 Feb 2018 11:36:19 +0800</pubDate><description><![CDATA[53. Maximum Subarray

 Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous]]></description><category></category></item><item><title><![CDATA[Leetcode 49. Group Anagrams]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79249066</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79249066</guid><author>CriminalCode</author><pubDate>Sat, 03 Feb 2018 20:18:53 +0800</pubDate><description><![CDATA[49. Group Anagrams


Given an array of strings, group anagrams together.
For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"],

Return:
[
  ["ate", "eat","tea"],
  ["nat","tan"],
  ["]]></description><category></category></item><item><title><![CDATA[Leetcode 48. Rotate Image]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79248447</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79248447</guid><author>CriminalCode</author><pubDate>Sat, 03 Feb 2018 17:50:57 +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).
Note:
You have to rotate the image in-place, which means you have to modify t]]></description><category></category></item><item><title><![CDATA[Leetcode 46. Permutations (全排列)]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79248014</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79248014</guid><author>CriminalCode</author><pubDate>Sat, 03 Feb 2018 16:51:35 +0800</pubDate><description><![CDATA[46. Permutations




DescriptionHintsSubmissionsDiscussSolution














Given a collection of distinct numbers, return all possible permutations.
For example,
[1,2,3] have ]]></description><category></category></item><item><title><![CDATA[Leetcode 39. Combination Sum (递归)]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79143740</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79143740</guid><author>CriminalCode</author><pubDate>Tue, 23 Jan 2018 20:00:46 +0800</pubDate><description><![CDATA[39. Combination Sum

 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 repeat]]></description><category></category></item><item><title><![CDATA[Leetcode 15. 3Sum]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79105679</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79105679</guid><author>CriminalCode</author><pubDate>Fri, 19 Jan 2018 13:37:06 +0800</pubDate><description><![CDATA[15. 3Sum


Given an array S of n integers, are there elements a,
b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note: The solution set must ]]></description><category></category></item><item><title><![CDATA[Leetcode 29. Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79078944</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79078944</guid><author>CriminalCode</author><pubDate>Tue, 16 Jan 2018 21:00:56 +0800</pubDate><description><![CDATA[29. Divide Two Integers


Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT. 



题目链接：https://leetcode.com/problems/divide-two-inte]]></description><category></category></item><item><title><![CDATA[Leetcode 3. Longest Substring Without Repeating Characters]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79078112</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79078112</guid><author>CriminalCode</author><pubDate>Tue, 16 Jan 2018 19:14:39 +0800</pubDate><description><![CDATA[3. Longest Substring Without Repeating Characters


Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb", the answer is 
"abc", which]]></description><category></category></item><item><title><![CDATA[Leetcode 21. Merge Two Sorted Lists]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79076363</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79076363</guid><author>CriminalCode</author><pubDate>Tue, 16 Jan 2018 16:31:33 +0800</pubDate><description><![CDATA[21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Example:
Input: 1->2->4, 1]]></description><category></category></item><item><title><![CDATA[Leetcode  26. Remove Duplicates from Sorted Array]]></title><link>https://blog.youkuaiyun.com/CriminalCode/article/details/79073701</link><guid>https://blog.youkuaiyun.com/CriminalCode/article/details/79073701</guid><author>CriminalCode</author><pubDate>Tue, 16 Jan 2018 13:31:56 +0800</pubDate><description><![CDATA[26. Remove Duplicates from Sorted Array

 Given a sorted array, remove the duplicates 
in-place such that each element appear only once and return the new length.
Do not allocate extra space for a]]></description><category></category></item></channel></rss>