<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[InfoSecPractitioner]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/starrrr2</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; starrrr2]]></copyright><item><title><![CDATA[[LeetCode]53. Maximum Subarray]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/82670103</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/82670103</guid><author>starrrr2</author><pubDate>Wed, 12 Sep 2018 23:08:24 +0800</pubDate><description><![CDATA[Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4], 
Output: 6 
Explanat...]]></description><category></category></item><item><title><![CDATA[[Leetcode]160.Intersection of Two Linked Lists]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/80889882</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/80889882</guid><author>starrrr2</author><pubDate>Mon, 02 Jul 2018 21:09:54 +0800</pubDate><description><![CDATA[160 Intersection of Two Linked Lists 
Easy

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

A:          a1 ...]]></description><category></category></item><item><title><![CDATA[[LeetCode]2. Add Two Numbers&67. Add Binary]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52830102</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52830102</guid><author>starrrr2</author><pubDate>Sun, 16 Oct 2016 13:48:32 +0800</pubDate><description><![CDATA[2. Add Two Numbers
67. Add Binary]]></description><category></category></item><item><title><![CDATA[[LeetCode]15. 3Sum【&16. 3Sum Closest】]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52791739</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52791739</guid><author>starrrr2</author><pubDate>Tue, 11 Oct 2016 21:08:15 +0800</pubDate><description><![CDATA[15. 3Sum
16. 3Sum Closest]]></description><category></category></item><item><title><![CDATA[[LeetCode]409. Longest Palindrome]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52746727</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52746727</guid><author>starrrr2</author><pubDate>Fri, 07 Oct 2016 00:25:07 +0800</pubDate><description><![CDATA[EasyGiven a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example “Aa” is not cons]]></description><category></category></item><item><title><![CDATA[[LeetCode]39.Combination Sum&40.Combination Sum II&216.Combination Sum III&377.Combination Sum IV]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52743230</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52743230</guid><author>starrrr2</author><pubDate>Thu, 06 Oct 2016 23:44:30 +0800</pubDate><description><![CDATA[39.Combination Sum
40.Combination Sum II
216.Combination Sum III
377.Combination Sum IV]]></description><category></category></item><item><title><![CDATA[[LeetCode]223. Rectangle Area]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52741472</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52741472</guid><author>starrrr2</author><pubDate>Wed, 05 Oct 2016 23:53:38 +0800</pubDate><description><![CDATA[Easy 
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Rectangle Area 
Assume that]]></description><category></category></item><item><title><![CDATA[[LeetCode]400. Nth Digit]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52740717</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52740717</guid><author>starrrr2</author><pubDate>Wed, 05 Oct 2016 21:26:59 +0800</pubDate><description><![CDATA[EasyFind the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: 
n is positive and will fit within the range of a 32-bit signed integer (n < 231).Example 1:Input: 
3Ou]]></description><category></category></item><item><title><![CDATA[[LeetCode]38. Count and Say]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52740364</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52740364</guid><author>starrrr2</author><pubDate>Wed, 05 Oct 2016 20:23:41 +0800</pubDate><description><![CDATA[EasyThe count-and-say sequence is the sequence of integers beginning as follows: 
1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 
11 is read off as “two 1s” or 21. 
21 is read off as “one 2,]]></description><category></category></item><item><title><![CDATA[[LeetCode]7. Reverse Integer&190. Reverse Bits]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52739584</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52739584</guid><author>starrrr2</author><pubDate>Wed, 05 Oct 2016 17:04:24 +0800</pubDate><description><![CDATA[7. Reverse Integer
190. Reverse Bits]]></description><category></category></item><item><title><![CDATA[[LeetCode]189. Rotate Array]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52739119</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52739119</guid><author>starrrr2</author><pubDate>Wed, 05 Oct 2016 15:55:24 +0800</pubDate><description><![CDATA[EasyRotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: 
Try to come up as many solutions as you can,]]></description><category></category></item><item><title><![CDATA[[LeetCode]343. Integer Break]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52737562</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52737562</guid><author>starrrr2</author><pubDate>Wed, 05 Oct 2016 10:11:07 +0800</pubDate><description><![CDATA[MediumGiven a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, re]]></description><category></category></item><item><title><![CDATA[[LeetCode]144. Binary Tree Preorder Traversal&94. Binary Tree Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52735618</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52735618</guid><author>starrrr2</author><pubDate>Tue, 04 Oct 2016 23:27:44 +0800</pubDate><description><![CDATA[144. Binary Tree Preorder Traversal
94. Binary Tree Inorder Traversal]]></description><category></category></item><item><title><![CDATA[[LeetCode]318. Maximum Product of Word Lengths]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52734498</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52734498</guid><author>starrrr2</author><pubDate>Tue, 04 Oct 2016 16:58:01 +0800</pubDate><description><![CDATA[MediumGiven a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case]]></description><category></category></item><item><title><![CDATA[[LeetCode]238. Product of Array Except Self]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52734199</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52734199</guid><author>starrrr2</author><pubDate>Tue, 04 Oct 2016 16:27:34 +0800</pubDate><description><![CDATA[MediumGiven an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n)]]></description><category></category></item><item><title><![CDATA[[LeetCode]204. Count Primes]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52732727</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52732727</guid><author>starrrr2</author><pubDate>Tue, 04 Oct 2016 10:06:19 +0800</pubDate><description><![CDATA[EasyDescription:Count the number of prime numbers less than a non-negative number, n.超时： public int countPrimes(int n) {
         int[] primes = new int[n/2+1];
         int p = 0;
         int i = 2;]]></description><category></category></item><item><title><![CDATA[[LeetCode]58. Length of Last Word]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52728769</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52728769</guid><author>starrrr2</author><pubDate>Mon, 03 Oct 2016 17:34:10 +0800</pubDate><description><![CDATA[EasyGiven a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string.If the last word does not exist, return 0.Note: A word is define]]></description><category></category></item><item><title><![CDATA[[LeetCode]257. Binary Tree Paths]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52717833</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52717833</guid><author>starrrr2</author><pubDate>Sat, 01 Oct 2016 16:24:53 +0800</pubDate><description><![CDATA[EasyGiven a binary tree, return all root-to-leaf paths.For example, given the following binary tree:1 
 /   \ 
2     3 
 \ 
  5 
All root-to-leaf paths are:[“1->2->5”, “1->3”]5ms:public List<String> bi]]></description><category></category></item><item><title><![CDATA[[LeetCode]118. Pascal's Triangle&119. Pascal's Triangle II]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52717712</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52717712</guid><author>starrrr2</author><pubDate>Sat, 01 Oct 2016 15:53:39 +0800</pubDate><description><![CDATA[118. Pascal's Triangle
119. Pascal's Triangle II]]></description><category></category></item><item><title><![CDATA[[LeetCode]112. Path Sum&113. Path Sum II]]></title><link>https://blog.youkuaiyun.com/starrrr2/article/details/52716801</link><guid>https://blog.youkuaiyun.com/starrrr2/article/details/52716801</guid><author>starrrr2</author><pubDate>Sat, 01 Oct 2016 12:16:35 +0800</pubDate><description><![CDATA[112 . Path Sum 
EasyGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: 
Given the below bin]]></description><category></category></item></channel></rss>