<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wl0627的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wl0627</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wl0627]]></copyright><item><title><![CDATA[leetcode 85. Maximal Rectangle]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52690755</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52690755</guid><author>wl0627</author><pubDate>Wed, 28 Sep 2016 15:17:03 +0800</pubDate><description><![CDATA[Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.For example, given the following matrix:1 0 1 0 0 
1 0 1 1 1 
1 1 1 1 1 
1 0 0 1 0]]></description><category></category></item><item><title><![CDATA[leetcode 84. Largest Rectangle in Histogram]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52684582</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52684582</guid><author>wl0627</author><pubDate>Wed, 28 Sep 2016 10:45:20 +0800</pubDate><description><![CDATA[Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width of each bar]]></description><category></category></item><item><title><![CDATA[leetcode 83. Remove Duplicates from Sorted List]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52682499</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52682499</guid><author>wl0627</author><pubDate>Tue, 27 Sep 2016 17:17:34 +0800</pubDate><description><![CDATA[Given a sorted linked list, delete all duplicates such that each element appear only once.For example, 
Given 1->1->2, return 1->2. 
Given 1->1->2->3->3, return 1->2->3.public ListNode deleteDuplicates]]></description><category></category></item><item><title><![CDATA[leetcode 82. Remove Duplicates from Sorted List II]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52682434</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52682434</guid><author>wl0627</author><pubDate>Tue, 27 Sep 2016 17:12:22 +0800</pubDate><description><![CDATA[Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, 
Given 1->2->3->3->4->4->5, return 1->2->5. 
Given 1->1->1->2]]></description><category></category></item><item><title><![CDATA[leetcode 81. Search in Rotated Sorted Array II]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52681210</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52681210</guid><author>wl0627</author><pubDate>Tue, 27 Sep 2016 15:32:35 +0800</pubDate><description><![CDATA[Follow up for “Search in Rotated Sorted Array”: 
What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the array.回顾]]></description><category></category></item><item><title><![CDATA[leetcode 80. Remove Duplicates from Sorted Array II]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52681127</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52681127</guid><author>wl0627</author><pubDate>Tue, 27 Sep 2016 15:26:34 +0800</pubDate><description><![CDATA[Follow up for “Remove Duplicates”: 
What if duplicates are allowed at most twice?For example, 
Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five elemen]]></description><category></category></item><item><title><![CDATA[leetcode 79. Word Search]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52680227</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52680227</guid><author>wl0627</author><pubDate>Tue, 27 Sep 2016 14:51:56 +0800</pubDate><description><![CDATA[Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those horizontally or vertically neig]]></description><category></category></item><item><title><![CDATA[leetcode 78. Subsets]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52680157</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52680157</guid><author>wl0627</author><pubDate>Tue, 27 Sep 2016 13:54:40 +0800</pubDate><description><![CDATA[Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example, 
If nums = [1,2,3], a solution is:[ 
  [3], 
  [1], 
  [2],]]></description><category></category></item><item><title><![CDATA[leetcode 77. Combinations]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52675926</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52675926</guid><author>wl0627</author><pubDate>Mon, 26 Sep 2016 23:52:01 +0800</pubDate><description><![CDATA[Given two integers n and k, return all possible combinations of k numbers out of 1 … n.For example, 
If n = 4 and k = 2, a solution is:[ 
  [2,4], 
  [3,4], 
  [2,3], 
  [1,2], 
  [1,3], 
  [1,4], 
]pu]]></description><category></category></item><item><title><![CDATA[leetcode 76. Minimum Window Substring]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52670600</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52670600</guid><author>wl0627</author><pubDate>Mon, 26 Sep 2016 19:14:44 +0800</pubDate><description><![CDATA[Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example, 
S = “ADOBECODEBANC” 
T = “ABC” 
Minimum window is “BANC”.Note:]]></description><category></category></item><item><title><![CDATA[leetcode 75. Sort Colors]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52624801</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52624801</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 17:18:52 +0800</pubDate><description><![CDATA[Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0, 1,]]></description><category></category></item><item><title><![CDATA[leetcode 74. Search a 2D Matrix]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52624430</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52624430</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 16:35:15 +0800</pubDate><description><![CDATA[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 from left to right. 
The first integer of each row is]]></description><category></category></item><item><title><![CDATA[leetcode 73. Set Matrix Zeroes]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52624200</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52624200</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 16:22:15 +0800</pubDate><description><![CDATA[Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.click to show follow up.Follow up: 
Did you use extra space? 
A straight forward solution using O(mn) space]]></description><category></category></item><item><title><![CDATA[leetcode 72. Edit Distance]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52623827</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52623827</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 16:08:14 +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 permitte]]></description><category></category></item><item><title><![CDATA[leetcode 71. Simplify Path]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52623429</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52623429</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 15:25:27 +0800</pubDate><description><![CDATA[Given an absolute path for a file (Unix-style), simplify it.For example, 
path = “/home/”, => “/home” 
path = “/a/./b/../../c/”, => “/c” 
click to show corner cases.Corner Cases: 
Did you consider the]]></description><category></category></item><item><title><![CDATA[leetcode 70. Climbing Stairs]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52622953</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52622953</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 14:49:01 +0800</pubDate><description><![CDATA[You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?public int climbStairs(int n) {]]></description><category></category></item><item><title><![CDATA[leetcode 69. Sqrt(x)]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52622912</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52622912</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 14:44:24 +0800</pubDate><description><![CDATA[public int mySqrt(int x) { 
         return (int)Math.sqrt(x); 
} 
A了就不想想了]]></description><category></category></item><item><title><![CDATA[leetcode 68. Text Justification]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52606504</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52606504</guid><author>wl0627</author><pubDate>Thu, 22 Sep 2016 11:22:47 +0800</pubDate><description><![CDATA[Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.

You should pack your words in a greedy approach; that is,]]></description><category></category></item><item><title><![CDATA[leetcode 67. Add Binary]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52606476</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52606476</guid><author>wl0627</author><pubDate>Wed, 21 Sep 2016 12:17:19 +0800</pubDate><description><![CDATA[Given two binary strings, return their sum (also a binary string).For example, 
a = “11” 
b = “1” 
Return “100”.public String addBinary(String a, String b) {
        int inta = Integer.parseInt(a, 2);]]></description><category></category></item><item><title><![CDATA[leetcode 66. Plus One]]></title><link>https://blog.youkuaiyun.com/wl0627/article/details/52606304</link><guid>https://blog.youkuaiyun.com/wl0627/article/details/52606304</guid><author>wl0627</author><pubDate>Wed, 21 Sep 2016 11:54:13 +0800</pubDate><description><![CDATA[Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.13:  int[]{1,3} 
27:  int[]{2]]></description><category></category></item></channel></rss>