<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[strike1989的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/strike1989</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; strike1989]]></copyright><item><title><![CDATA[44. 最小子数组]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463957</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463957</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:18:16 +0800</pubDate><description><![CDATA[给定一个整数数组，找到一个具有最小和的子数组。返回其最小和。样例给出数组[1, -1, -2, 1]，返回 -3public class Solution {
    /*
     * @param nums: a list of integers
     * @return: A integer indicate the sum of minimum subarray
     */
   ...]]></description><category></category></item><item><title><![CDATA[42. 最大子数组 II]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463951</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463951</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:17:43 +0800</pubDate><description><![CDATA[给定一个整数数组，找出两个 不重叠 子数组使得它们的和最大。每个子数组的数字在数组中的位置应该是连续的。返回最大的和。样例给出数组 [1, 3, -1, 2, -1, 2]这两个子数组分别为 [1, 3] 和 [2, -1, 2] 或者 [1, 3, -1, 2] 和 [2]，它们的最大和都是 7public class Solution {
    /*
     * @param nums: ...]]></description><category></category></item><item><title><![CDATA[41. 最大子数组]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463942</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463942</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:16:51 +0800</pubDate><description><![CDATA[给定一个整数数组，找到一个具有最大和的子数组，返回其最大和。样例给出数组[−2,2,−3,4,−1,2,1,−5,3]，符合要求的子数组为[4,−1,2,1]，其最大和为6public class Solution {
    /**
     * @param nums: A list of integers
     * @return: A integer indicate the sum ...]]></description><category></category></item><item><title><![CDATA[40. 用栈实现队列]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463936</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463936</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:16:16 +0800</pubDate><description><![CDATA[正如标题所述，你需要使用两个栈来实现队列的一些操作。队列应支持push(element)，pop() 和 top()，其中pop是弹出队列中的第一个(最前面的)元素。pop和top方法都应该返回第一个元素的值。样例比如push(1), pop(), push(2), push(3), top(), pop()，你应该返回1，2和2public class MyQueue {
    
    St...]]></description><category></category></item><item><title><![CDATA[39. 恢复旋转排序数组]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463927</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463927</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:15:41 +0800</pubDate><description><![CDATA[给定一个旋转排序数组，在原地恢复其排序。说明什么是旋转数组？比如，原始数组为[1,2,3,4], 则其旋转数组可以是[1,2,3,4], [2,3,4,1], [3,4,1,2], [4,1,2,3]样例[4, 5, 1, 2, 3] -&amp;gt; [1, 2, 3, 4, 5]public class Solution {
    /*
     * @param nums: An integer...]]></description><category></category></item><item><title><![CDATA[38. 搜索二维矩阵 II]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463920</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463920</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:14:48 +0800</pubDate><description><![CDATA[写出一个高效的算法来搜索m×n矩阵中的值，返回这个值出现的次数。这个矩阵具有以下特性：每行中的整数从左到右是排序的。每一列的整数从上到下是排序的。在每一行或每一列中没有重复的整数。样例考虑下列矩阵：[    [1, 3, 5, 7],    [2, 4, 7, 8],    [3, 5, 9, 10]]给出target = 3，返回 2public class Solution {
    /*
...]]></description><category></category></item><item><title><![CDATA[37. 反转一个3位整数]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463910</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463910</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:14:14 +0800</pubDate><description><![CDATA[反转一个只有3位数的整数。样例123 反转之后是 321。900 反转之后是 9。public class Solution {
    /**
     * @param number: A 3-digit number.
     * @return: Reversed number.
     */
    public int reverseInteger(int number) {
  ...]]></description><category></category></item><item><title><![CDATA[36. 翻转链表 II]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463904</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463904</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:13:35 +0800</pubDate><description><![CDATA[翻转链表中第m个节点到第n个节点的部分样例给出链表1-&amp;gt;2-&amp;gt;3-&amp;gt;4-&amp;gt;5-&amp;gt;null， m = 2 和n = 4，返回1-&amp;gt;4-&amp;gt;3-&amp;gt;2-&amp;gt;5-&amp;gt;null/**
 * Definition for ListNode
 * public class ListNode {
 *     int val;
 *     ListNode ...]]></description><category></category></item><item><title><![CDATA[35. 翻转链表]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463897</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463897</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:13:01 +0800</pubDate><description><![CDATA[翻转一个链表样例给出一个链表1-&amp;gt;2-&amp;gt;3-&amp;gt;null，这个翻转后的链表为3-&amp;gt;2-&amp;gt;1-&amp;gt;null/**
 * Definition for ListNode
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         ...]]></description><category></category></item><item><title><![CDATA[32. 最小子串覆盖]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463885</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463885</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:12:28 +0800</pubDate><description><![CDATA[给定一个字符串source和一个目标字符串target，在字符串source中找到包括所有目标字符串字母的子串。说明在答案的子串中的字母在目标字符串中是否需要具有相同的顺序？——不需要。样例给出source = &quot;ADOBECODEBANC&quot;，target = &quot;ABC&quot; 满足要求的解  &quot;BANC&quot;public class Solution {
    /**
     * @param sou...]]></description><category></category></item><item><title><![CDATA[31. 数组划分]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463877</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463877</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:11:42 +0800</pubDate><description><![CDATA[给出一个整数数组 nums 和一个整数 k。划分数组（即移动数组 nums 中的元素），使得：所有小于k的元素移到左边所有大于等于k的元素移到右边返回数组划分的位置，即数组中第一个位置 i，满足 nums[i] 大于等于 k。样例给出数组 nums = [3,2,2,1] 和 k = 2，返回 1.public class Solution {
    /**
     * @param nums...]]></description><category></category></item><item><title><![CDATA[30. 插入区间]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463870</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463870</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:11:06 +0800</pubDate><description><![CDATA[给出一个无重叠的按照区间起始端点排序的区间列表。在列表中插入一个新的区间，你要确保列表中的区间仍然有序且不重叠（如果有必要的话，可以合并区间）。样例插入区间[2, 5] 到 [[1,2], [5,9]]，我们得到 [[1,9]]。插入区间[3, 4] 到 [[1,2], [5,9]]，我们得到 [[1,2], [3,4], [5,9]]。/**
 * Definition of Interval:...]]></description><category></category></item><item><title><![CDATA[29. 交叉字符串]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463863</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463863</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:10:17 +0800</pubDate><description><![CDATA[给出三个字符串:s1、s2、s3，判断s3是否由s1和s2交叉构成。样例比如 s1 = &quot;aabcc&quot; s2 = &quot;dbbca&quot;    - 当 s3 = &quot;aadbbcbcac&quot;，返回  true.    - 当 s3 = &quot;aadbbbaccc&quot;， 返回 false.public class Solution {
    /**
     * @param s1: A string
     *...]]></description><category></category></item><item><title><![CDATA[28. 搜索二维矩阵]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463848</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463848</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:09:44 +0800</pubDate><description><![CDATA[写出一个高效的算法来搜索 m × n矩阵中的值。这个矩阵具有以下特性：每行中的整数从左到右是排序的。每行的第一个数大于上一行的最后一个整数。样例考虑下列矩阵：[
  [1, 3, 5, 7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]
给出 target = 3，返回 truepublic class Solution {
    /*
     * @pa...]]></description><category></category></item><item><title><![CDATA[22. 平面列表]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463839</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463839</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:08:58 +0800</pubDate><description><![CDATA[给定一个列表，该列表中的每个要素要么是个列表，要么是整数。将其变成一个只包含整数的简单列表。样例给定 [1,2,[1,2]]，返回 [1,2,1,2]。给定 [4,[3,[2,[1]]]]，返回 [4,3,2,1]。/**
 * // This is the interface that allows for creating nested lists.
 * // You should not ...]]></description><category></category></item><item><title><![CDATA[20. 骰子求和]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463829</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463829</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:08:24 +0800</pubDate><description><![CDATA[扔 n 个骰子，向上面的数字之和为 S。给定 Given n，请列出所有可能的 S 值及其相应的概率。样例给定 n = 1，返回 [ [1, 0.17], [2, 0.17], [3, 0.17], [4, 0.17], [5, 0.17], [6, 0.17]]。public class Solution {
    /**
     * @param n an integer
     * @...]]></description><category></category></item><item><title><![CDATA[18. 带重复元素的子集]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463823</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463823</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:07:49 +0800</pubDate><description><![CDATA[给定一个可能具有重复数字的列表，返回其所有可能的子集样例如果 S = [1,2,2]，一个可能的答案为：[
  [2],
  [1],
  [1,2,2],
  [2,2],
  [1,2],
  []
]public class Solution {
    /*
     * @param nums: A set of numbers.
     * @return: A list of li...]]></description><category></category></item><item><title><![CDATA[17. 子集]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463817</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463817</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:07:17 +0800</pubDate><description><![CDATA[给定一个含不同整数的集合，返回其所有的子集样例如果 S = [1,2,3]，有如下的解：[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]public class Solution {
    
    /*
     * @param nums: A set of numbers
     * @return: ...]]></description><category></category></item><item><title><![CDATA[16. 带重复元素的排列]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463807</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463807</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:06:44 +0800</pubDate><description><![CDATA[给出一个具有重复数字的列表，找出列表所有不同的排列。样例给出列表 [1,2,2]，不同的排列有：[
  [1,2,2],
  [2,1,2],
  [2,2,1]
]public class Solution {
    /*
     * @param :  A list of integers
     * @return: A list of unique permutations
    ...]]></description><category></category></item><item><title><![CDATA[15. 全排列]]></title><link>https://blog.youkuaiyun.com/strike1989/article/details/79463796</link><guid>https://blog.youkuaiyun.com/strike1989/article/details/79463796</guid><author>strike1989</author><pubDate>Tue, 06 Mar 2018 21:06:09 +0800</pubDate><description><![CDATA[给定一个数字列表，返回其所有可能的排列。样例给出一个列表[1,2,3]，其全排列为：[
  [1,2,3],
  [1,3,2],
  [2,1,3],
  [2,3,1],
  [3,1,2],
  [3,2,1]
]public class Solution {
    /*
     * @param nums: A list of integers.
     * @return: A l...]]></description><category></category></item></channel></rss>