<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lianych的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lianych</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lianych]]></copyright><item><title><![CDATA[LeetCode: Partition Equal Subset Sum]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/54234221</link><guid>https://blog.youkuaiyun.com/lianych/article/details/54234221</guid><author>lianych</author><pubDate>Sun, 08 Jan 2017 15:44:34 +0800</pubDate><description><![CDATA[题目 
Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note: 
Each of the array elem]]></description><category></category></item><item><title><![CDATA[LeetCode: Ones and Zeroes]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/54234131</link><guid>https://blog.youkuaiyun.com/lianych/article/details/54234131</guid><author>lianych</author><pubDate>Sun, 08 Jan 2017 15:31:50 +0800</pubDate><description><![CDATA[题目： 
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On the othe]]></description><category></category></item><item><title><![CDATA[LeetCode: Matchsticks to Square]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/54178000</link><guid>https://blog.youkuaiyun.com/lianych/article/details/54178000</guid><author>lianych</author><pubDate>Sat, 07 Jan 2017 20:55:41 +0800</pubDate><description><![CDATA[题目： 
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You s]]></description><category></category></item><item><title><![CDATA[LeetCode: Matchsticks to Square]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/54177623</link><guid>https://blog.youkuaiyun.com/lianych/article/details/54177623</guid><author>lianych</author><pubDate>Sat, 07 Jan 2017 20:08:58 +0800</pubDate><description><![CDATA[题目： 
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You s]]></description><category></category></item><item><title><![CDATA[LeetCode:  Remove K Digits]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/54177163</link><guid>https://blog.youkuaiyun.com/lianych/article/details/54177163</guid><author>lianych</author><pubDate>Sat, 07 Jan 2017 19:06:57 +0800</pubDate><description><![CDATA[题目： 
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.Note: 
The length of num is less than 10002 and will be ≥]]></description><category></category></item><item><title><![CDATA[《算法概论》8.8]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/53352864</link><guid>https://blog.youkuaiyun.com/lianych/article/details/53352864</guid><author>lianych</author><pubDate>Sat, 26 Nov 2016 16:55:10 +0800</pubDate><description><![CDATA[题目： 
在精确的4SAT（EXACT 4SAT）问题中，输入为一组自居，每个字句都是恰好4个文字的析取，且每个变量最多在每个字句中出现一次。目标是求它的满足赋值——如果该赋值存在。证明精确的4SAT是NP完全问题。证明： 
用归约来证明：如果问题A可以归约到问题B，记作A->B，如果A是NP完全问题，则通过归约证明B也是NP完全问题。即问题的难度是通过箭头的方向传递的。现在要证明EXACT 4SA]]></description><category></category></item><item><title><![CDATA[LeetCode: Count Numbers with Unique Digits]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/53161494</link><guid>https://blog.youkuaiyun.com/lianych/article/details/53161494</guid><author>lianych</author><pubDate>Mon, 14 Nov 2016 17:35:46 +0800</pubDate><description><![CDATA[题目： 
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.Example: 
Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, ex]]></description><category></category></item><item><title><![CDATA[LeetCode: Triangle]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/53139243</link><guid>https://blog.youkuaiyun.com/lianych/article/details/53139243</guid><author>lianych</author><pubDate>Sat, 12 Nov 2016 12:23:10 +0800</pubDate><description><![CDATA[题目： 
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 example, given the following triangle 
[ 
     [2], 
    [3,4],]]></description><category></category></item><item><title><![CDATA[LeetCode: Course Schedule]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/53066165</link><guid>https://blog.youkuaiyun.com/lianych/article/details/53066165</guid><author>lianych</author><pubDate>Mon, 07 Nov 2016 14:41:40 +0800</pubDate><description><![CDATA[题目： 
There are a total of n courses you have to take, labeled from 0 to n - 1. 
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as]]></description><category></category></item><item><title><![CDATA[LeetCode: Word Break]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52996776</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52996776</guid><author>lianych</author><pubDate>Tue, 01 Nov 2016 15:55:42 +0800</pubDate><description><![CDATA[题目： 
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, given 
s = “leetcode”, 
dict = [“leet”]]></description><category></category></item><item><title><![CDATA[LeetCode: Candy]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52995371</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52995371</guid><author>lianych</author><pubDate>Tue, 01 Nov 2016 14:11:50 +0800</pubDate><description><![CDATA[题目： 
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 at least on]]></description><category></category></item><item><title><![CDATA[LeetCode: Multiply Strings]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52986007</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52986007</guid><author>lianych</author><pubDate>Mon, 31 Oct 2016 20:17:47 +0800</pubDate><description><![CDATA[题目： 
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: 
The numbers can be arbitrarily large and are non-negative. 
Converting the input string to integer]]></description><category></category></item><item><title><![CDATA[LeetCode: Search Insert Position]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52984330</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52984330</guid><author>lianych</author><pubDate>Mon, 31 Oct 2016 17:37:11 +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 arra]]></description><category></category></item><item><title><![CDATA[LeetCode:  Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52974688</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52974688</guid><author>lianych</author><pubDate>Sun, 30 Oct 2016 21:50:17 +0800</pubDate><description><![CDATA[题目： 
Divide two integers without using multiplication, division and mod operator. 
If it is overflow, return MAX_INT.题目很有意思，要求在不做乘法、除法、取余运算的条件下求两个除数相除的结果。 
首先想到的是做减法，用一个变量标记两数相除的结果的正负（两数同号为正，异号为负），然后把除]]></description><category></category></item><item><title><![CDATA[LeetCode: Integer to Roman]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52968527</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52968527</guid><author>lianych</author><pubDate>Sat, 29 Oct 2016 23:56:04 +0800</pubDate><description><![CDATA[做了罗马数字转整数的问题后，再称热打铁做了一道镜像问题：整数转罗马数字，其中，给定的整数范围为1~3999。罗马数字字符I、V、X、L、C、D、M分别表示1、5、10、50、100、500、1000，如果直接以上面的数字为单位对给定的整数取位再转化为罗马数字，很容易出错。不如先用罗马数字来表示我们熟悉的十进制的各个位，再对给定的整数取十进制下的位，然后找出对应位上的罗马数字表示法，加到结果中。代码：]]></description><category></category></item><item><title><![CDATA[LeetCode: Roman to Integer]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52965450</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52965450</guid><author>lianych</author><pubDate>Sat, 29 Oct 2016 17:01:40 +0800</pubDate><description><![CDATA[题目： 
Given a roman numeral, convert it to an integer. 
Input is guaranteed to be within the range from 1 to 3999.题目给定一个字符组成的罗马数字，要求把这个罗马数字转化为整数。答题之前，需要先了解一下罗马数字的表示： 
在罗马数字中，I，V，X，L，C，D，M分别表示阿拉伯数字的1,5,1]]></description><category></category></item><item><title><![CDATA[LeetCode: Split Array Largest Sum]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52861853</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52861853</guid><author>lianych</author><pubDate>Wed, 19 Oct 2016 17:58:37 +0800</pubDate><description><![CDATA[题目： 
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m]]></description><category></category></item><item><title><![CDATA[LeetCode: Is Subsequence]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52840649</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52840649</guid><author>lianych</author><pubDate>Mon, 17 Oct 2016 18:13:50 +0800</pubDate><description><![CDATA[题目： 
Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) strin]]></description><category></category></item><item><title><![CDATA[LeetCode: Arithmetic Slices]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52840407</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52840407</guid><author>lianych</author><pubDate>Mon, 17 Oct 2016 17:41:01 +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 sequenc]]></description><category></category></item><item><title><![CDATA[LeetCode: Longest Increasing Subsequence]]></title><link>https://blog.youkuaiyun.com/lianych/article/details/52808849</link><guid>https://blog.youkuaiyun.com/lianych/article/details/52808849</guid><author>lianych</author><pubDate>Thu, 13 Oct 2016 17:58:29 +0800</pubDate><description><![CDATA[题目： 
Given an unsorted array of integers, find the length of longest increasing subsequence.For example, 
Given [10, 9, 2, 5, 3, 7, 101, 18], 
The longest increasing subsequence is [2, 3, 7, 101], ther]]></description><category></category></item></channel></rss>