<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[pkmifeng的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/pkmifeng</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; pkmifeng]]></copyright><item><title><![CDATA[第八章课后作业]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/73694541</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/73694541</guid><author>pkmifeng</author><pubDate>Sat, 24 Jun 2017 19:45:26 +0800</pubDate><description><![CDATA[Chapter 8 NP-complete problems
8.10
description
Proving NP-completeness by generalization. For each of the problems below, prove that it is NP-complete by showing that it is a generalization of some ....]]></description><category></category></item><item><title><![CDATA[最大和]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/73694479</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/73694479</guid><author>pkmifeng</author><pubDate>Sat, 24 Jun 2017 19:30:27 +0800</pubDate><description><![CDATA[最大和
description
从数列A[0], A[1], A[2], …, A[N-1]中选若干个数，要求相邻的数不能都选，也就是说如果选了A[i], 就不能选A[i-1]和A[i+1]. 求能选出的最大和.1 <= N <= 100000, 1 <= A[i] <= 1000请为下面的Solution类实现解决上述问题的函数maxSum，函数参数A是给出的数列，返回值为所求的最大和]]></description><category></category></item><item><title><![CDATA[Valid Perfect Square]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/73038631</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/73038631</guid><author>pkmifeng</author><pubDate>Sun, 11 Jun 2017 16:02:12 +0800</pubDate><description><![CDATA[Valid Perfect Square
description
Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt()....]]></description><category></category></item><item><title><![CDATA[Guess Number Higher or Lower]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/73038531</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/73038531</guid><author>pkmifeng</author><pubDate>Sun, 11 Jun 2017 15:57:54 +0800</pubDate><description><![CDATA[Guess Number Higher or Lower
description
We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong....]]></description><category></category></item><item><title><![CDATA[Is Subsequence]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/73038184</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/73038184</guid><author>pkmifeng</author><pubDate>Sun, 11 Jun 2017 15:52:00 +0800</pubDate><description><![CDATA[Is Subsequence
description
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 ....]]></description><category></category></item><item><title><![CDATA[Arranging Coins]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/73036708</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/73036708</guid><author>pkmifeng</author><pubDate>Sun, 11 Jun 2017 15:47:14 +0800</pubDate><description><![CDATA[Arranging Coins
description
You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.]]></description><category></category></item><item><title><![CDATA[Excel Sheet Column Number]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/72575419</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/72575419</guid><author>pkmifeng</author><pubDate>Sat, 20 May 2017 13:32:02 +0800</pubDate><description><![CDATA[Excel Sheet Column Number
description
Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.]]></description><category></category></item><item><title><![CDATA[pow(x, n)]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/72575391</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/72575391</guid><author>pkmifeng</author><pubDate>Sat, 20 May 2017 13:27:02 +0800</pubDate><description><![CDATA[pow(x, n)
description
Implement pow(x, n).]]></description><category></category></item><item><title><![CDATA[Roman to Integer]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/72575366</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/72575366</guid><author>pkmifeng</author><pubDate>Sat, 20 May 2017 13:20:06 +0800</pubDate><description><![CDATA[Roman to Integer
description 
Given a roman numeral, convert it to an integer. 
Input is guaranteed to be within the range from 1 to 3999.]]></description><category></category></item><item><title><![CDATA[Remove K Digits]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/70662912</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/70662912</guid><author>pkmifeng</author><pubDate>Mon, 24 Apr 2017 20:59:32 +0800</pubDate><description><![CDATA[Remove K Digitsproblem:
     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.]]></description><category></category></item><item><title><![CDATA[Decode String]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/70661383</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/70661383</guid><author>pkmifeng</author><pubDate>Mon, 24 Apr 2017 20:43:20 +0800</pubDate><description><![CDATA[Decode Stringproblem:
Given an encoded string, return it’s decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times.]]></description><category></category></item><item><title><![CDATA[Next Greater Element I]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/70659679</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/70659679</guid><author>pkmifeng</author><pubDate>Mon, 24 Apr 2017 20:34:02 +0800</pubDate><description><![CDATA[Next Greater Element Iproblem:You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1’s elements in the .......]]></description><category></category></item><item><title><![CDATA[Kth Largest Element in an Array]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/69669303</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/69669303</guid><author>pkmifeng</author><pubDate>Sat, 08 Apr 2017 15:29:06 +0800</pubDate><description><![CDATA[description:
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.]]></description><category></category></item><item><title><![CDATA[Search a 2D Matrix II]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/69668998</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/69668998</guid><author>pkmifeng</author><pubDate>Sat, 08 Apr 2017 15:17:11 +0800</pubDate><description><![CDATA[description：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 in ascending from left to right.....]]></description><category></category></item><item><title><![CDATA[Different Ways to Add Parentheses]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/69668908</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/69668908</guid><author>pkmifeng</author><pubDate>Sat, 08 Apr 2017 15:04:42 +0800</pubDate><description><![CDATA[description:Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.]]></description><category></category></item><item><title><![CDATA[Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/63687795</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/63687795</guid><author>pkmifeng</author><pubDate>Sun, 19 Mar 2017 19:45:00 +0800</pubDate><description><![CDATA[Maximum Subarray
description：
  Find the contiguous subarray within an array (containing at least one number) which has the largest sum.]]></description><category></category></item><item><title><![CDATA[文章标题]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/61616260</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/61616260</guid><author>pkmifeng</author><pubDate>Sun, 12 Mar 2017 12:51:39 +0800</pubDate><description><![CDATA[Majority Element
description:
  Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.]]></description><category></category></item><item><title><![CDATA[#Roman to Integer]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/60470577</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/60470577</guid><author>pkmifeng</author><pubDate>Sun, 05 Mar 2017 19:25:43 +0800</pubDate><description><![CDATA[Roman to Integer：Given a roman numeral, convert it to an integer.]]></description><category></category></item><item><title><![CDATA[欢迎使用优快云-markdown编辑器]]></title><link>https://blog.youkuaiyun.com/pkmifeng/article/details/57525812</link><guid>https://blog.youkuaiyun.com/pkmifeng/article/details/57525812</guid><author>pkmifeng</author><pubDate>Sun, 26 Feb 2017 22:28:37 +0800</pubDate><description><![CDATA[Two Sum]]></description><category></category></item></channel></rss>