<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[PIG_CODE的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/PIG_CODE</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; PIG_CODE]]></copyright><item><title><![CDATA[942. DI String Match]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/84561143</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/84561143</guid><author>PIG_CODE</author><pubDate>Tue, 27 Nov 2018 10:11:40 +0800</pubDate><description><![CDATA[Given a string S that only contains &quot;I&quot; (increase) or &quot;D&quot; (decrease), let N = S.length.

Return any permutation A of [0, 1, ..., N] such that for all i = 0, ..., N-1:

If S[i] == &quot;I&quot;, then A[i] &amp;lt; A...]]></description><category></category></item><item><title><![CDATA[908.Smallest Range I]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83830822</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83830822</guid><author>PIG_CODE</author><pubDate>Wed, 07 Nov 2018 20:11:04 +0800</pubDate><description><![CDATA[Given an array A of integers, for each integer A[i] we may choose any x with -K &amp;lt;= x &amp;lt;= K, and add x to A[i].

After this process, we have some array B.

Return the smallest possible difference ...]]></description><category></category></item><item><title><![CDATA[929. Unique Email Address]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83830186</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83830186</guid><author>PIG_CODE</author><pubDate>Wed, 07 Nov 2018 19:46:34 +0800</pubDate><description><![CDATA[If you add a plus ('+') in the local name, everything after the first plus sign will be ignored. This allows certain emails to be filtered, for example m.y+name@email.com will be forwarded to my@email...]]></description><category></category></item><item><title><![CDATA[922. Sort Array By Partity II]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83651647</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83651647</guid><author>PIG_CODE</author><pubDate>Fri, 02 Nov 2018 10:41:38 +0800</pubDate><description><![CDATA[Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even.

Sort the array so that whenever A[i] is odd, i is odd; and whenever A[i] is even, i is...]]></description><category></category></item><item><title><![CDATA[852.Peak Index in a Mountain Array]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83627549</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83627549</guid><author>PIG_CODE</author><pubDate>Fri, 02 Nov 2018 09:11:58 +0800</pubDate><description><![CDATA[Let's call an array A a mountain if the following properties hold:

A.length &amp;gt;= 3
	There exists some 0 &amp;lt; i &amp;lt; A.length - 1 such that A[0] &amp;lt; A[1] &amp;lt; ... A[i-1] &amp;lt; A[i] &amp;gt; A[i+1] &amp;gt; ....]]></description><category></category></item><item><title><![CDATA[728. Self-Dividing-Numbers]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83627236</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83627236</guid><author>PIG_CODE</author><pubDate>Thu, 01 Nov 2018 21:19:42 +0800</pubDate><description><![CDATA[A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Also, a self-dividin...]]></description><category></category></item><item><title><![CDATA[709. To Lower Case]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83506153</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83506153</guid><author>PIG_CODE</author><pubDate>Mon, 29 Oct 2018 15:21:19 +0800</pubDate><description><![CDATA[ 

Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase.

 

Example 1:

Input: &quot;Hello&quot;Output: &quot;hello&quot;

Example 2:


Input: &quot;here&quot;
Output: &quot;here&quot;
...]]></description><category></category></item><item><title><![CDATA[136. Single Number]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83413577</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83413577</guid><author>PIG_CODE</author><pubDate>Fri, 26 Oct 2018 13:45:24 +0800</pubDate><description><![CDATA[Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Note:

Your algorithm should have a linear runtime complexity. Could you implement it without us...]]></description><category></category></item><item><title><![CDATA[7. Reverse Integer]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/83385031</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/83385031</guid><author>PIG_CODE</author><pubDate>Thu, 25 Oct 2018 19:43:11 +0800</pubDate><description><![CDATA[Given a 32-bit signed integer, reverse digits of an integer.

Example 1:


Input: 123
Output: 321


Example 2:


Input: -123
Output: -321


Example 3:


Input: 120
Output: 21


Note:
Assume we are dea...]]></description><category></category></item><item><title><![CDATA[718. Maximum Length of Repeated Subarray]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/79151181</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/79151181</guid><author>PIG_CODE</author><pubDate>Wed, 24 Jan 2018 15:15:06 +0800</pubDate><description><![CDATA[Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.

Example 1:


Input:
A: [1,2,3,2,1]
B: [3,2,1,4,7]
Output: 3
Explanation: 
The repeated subarray...]]></description><category></category></item><item><title><![CDATA[72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/79128827</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/79128827</guid><author>PIG_CODE</author><pubDate>Mon, 22 Jan 2018 14:47:04 +0800</pubDate><description><![CDATA[
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)

You have the following 3 operations permitted on a word:
...]]></description><category></category></item><item><title><![CDATA[712. Minimum ASCII Delete Sum for Two Strings]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/79116889</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/79116889</guid><author>PIG_CODE</author><pubDate>Sat, 20 Jan 2018 21:23:16 +0800</pubDate><description><![CDATA[Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.

Example 1:


Input: s1 = &quot;sea&quot;, s2 = &quot;eat&quot;
Output: 231
Explanation: Deleting &quot;s&quot; from &quot;sea&quot; adds t...]]></description><category></category></item><item><title><![CDATA[413. Arithmetic Slices]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/79091698</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/79091698</guid><author>PIG_CODE</author><pubDate>Thu, 18 Jan 2018 09:05:43 +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[647. Palindromic Substrings]]></title><link>https://blog.youkuaiyun.com/PIG_CODE/article/details/78991613</link><guid>https://blog.youkuaiyun.com/PIG_CODE/article/details/78991613</guid><author>PIG_CODE</author><pubDate>Thu, 18 Jan 2018 08:45:58 +0800</pubDate><description><![CDATA[Problem description: Given a string, your task is to count how many palindromic substrings in this string.

The substrings with different start indexes or end indexes are counted as different substrin...]]></description><category></category></item></channel></rss>