<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[西施豆腐渣]]></title><description><![CDATA[leetcode solutions by java, c++ and python]]></description><link>https://blog.youkuaiyun.com/xudli</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xudli]]></copyright><item><title><![CDATA[求一个整数stream的sum， avg， median]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/52750570</link><guid>https://blog.youkuaiyun.com/xudli/article/details/52750570</guid><author>xudli</author><pubDate>Fri, 07 Oct 2016 17:22:00 +0800</pubDate><description><![CDATA[好久没更新了， 上个新题吧。 求一个整数stream的sum， avg， median。 数据不断流入， 随时求sum， avg， median

 1) consume(int value)
 
 2 million
 
 2) getSum()
 3) getAverage()
 4) getMedian()
 
 
 1
 2
 -1
 0
 getSum => 1+2-1+0
 4 
]]></description><category></category></item><item><title><![CDATA[leetcode 303: Range Sum Query - Immutable]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/49763033</link><guid>https://blog.youkuaiyun.com/xudli/article/details/49763033</guid><author>xudli</author><pubDate>Tue, 10 Nov 2015 17:47:28 +0800</pubDate><description><![CDATA[Range Sum Query - Immutable




Total Accepted: 
696 Total Submissions: 
2406 Difficulty: Easy


Given an integer array nums, find the sum of the elements between indices
i and j (i ≤ j), i]]></description><category></category></item><item><title><![CDATA[leetcode 301: Smallest Rectangle Enclosing Black Pixels]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/49738267</link><guid>https://blog.youkuaiyun.com/xudli/article/details/49738267</guid><author>xudli</author><pubDate>Mon, 09 Nov 2015 14:37:58 +0800</pubDate><description><![CDATA[Smallest Rectangle Enclosing Black Pixels




Total Accepted: 
575 Total Submissions: 
1481 Difficulty: Medium

An image is represented by a binary matrix with 0 as a white pixel and
1 as a ]]></description><category></category></item><item><title><![CDATA[leetcode 300: Longest Increasing Subsequence]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/49613805</link><guid>https://blog.youkuaiyun.com/xudli/article/details/49613805</guid><author>xudli</author><pubDate>Tue, 03 Nov 2015 11:24:29 +0800</pubDate><description><![CDATA[Longest Increasing Subsequence




Total Accepted: 
53 Total Submissions: 
172 Difficulty: Medium

Given an unsorted array of integers, find the length of longest increasing subsequence.
For]]></description><category></category></item><item><title><![CDATA[leetcode 298: Binary Tree Longest Consecutive Sequence]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/49493401</link><guid>https://blog.youkuaiyun.com/xudli/article/details/49493401</guid><author>xudli</author><pubDate>Thu, 29 Oct 2015 16:35:32 +0800</pubDate><description><![CDATA[Binary Tree Longest Consecutive Sequence




Total Accepted: 
437 Total Submissions: 
1351 Difficulty: Medium


Given a binary tree, find the length of the longest consecutive sequence path.]]></description><category></category></item><item><title><![CDATA[leetcode 296: Best Meeting Point]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/49420623</link><guid>https://blog.youkuaiyun.com/xudli/article/details/49420623</guid><author>xudli</author><pubDate>Mon, 26 Oct 2015 09:59:50 +0800</pubDate><description><![CDATA[Best Meeting Point




Total Accepted: 
701 Total Submissions: 
1714 Difficulty: Medium

A group of two or more people wants to meet and minimize the total travel distance. You are given a 2D]]></description><category></category></item><item><title><![CDATA[leetcode 290: Word Pattern]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48932055</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48932055</guid><author>xudli</author><pubDate>Tue, 06 Oct 2015 16:10:22 +0800</pubDate><description><![CDATA[Word Pattern




Total Accepted: 
1733 Total Submissions: 
6204 Difficulty: Easy


Given a pattern and a string str, find if str follows the same pattern.
Examples:


pattern = "abba", s]]></description><category></category></item><item><title><![CDATA[leetcode 289: Game of Life]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48896549</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48896549</guid><author>xudli</author><pubDate>Sun, 04 Oct 2015 15:19:14 +0800</pubDate><description><![CDATA[Game of Life




Total Accepted: 
606 Total Submissions: 
1907 Difficulty: Medium

According to the 
Wikipedia's article: "The Game of Life, also known simply as
Life, is a cellular automat]]></description><category></category></item><item><title><![CDATA[leetcode 288: Unique Word Abbreviation]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48860911</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48860911</guid><author>xudli</author><pubDate>Fri, 02 Oct 2015 16:20:23 +0800</pubDate><description><![CDATA[Unique Word Abbreviation




Total Accepted: 
351 Total Submissions: 
2106 Difficulty: Easy

An abbreviation of a word follows the form . Below are some examples of word abbreviations:
a) it]]></description><category></category></item><item><title><![CDATA[leetcode 287: Find the Duplicate Number]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48802345</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48802345</guid><author>xudli</author><pubDate>Tue, 29 Sep 2015 08:29:12 +0800</pubDate><description><![CDATA[Find the Duplicate Number







Total Accepted: 
1340 Total Submissions: 
4766 Difficulty: Hard

Given an array nums containing n + 1 integers where each integer is between 1 and
n (incl]]></description><category></category></item><item><title><![CDATA[leetcode 243: Shortest Word Distance]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48766955</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48766955</guid><author>xudli</author><pubDate>Sun, 27 Sep 2015 15:15:26 +0800</pubDate><description><![CDATA[Shortest Word Distance




Total Accepted: 
1754 Total Submissions: 
4239 Difficulty: Easy

Given a list of words and two words word1 and word2, return the shortest distance between these two]]></description><category></category></item><item><title><![CDATA[leetcode 272:  Closest Binary Search Tree Value II]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48752907</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48752907</guid><author>xudli</author><pubDate>Sat, 26 Sep 2015 18:09:09 +0800</pubDate><description><![CDATA[Closest Binary Search Tree Value II




Total Accepted: 
984 Total Submissions: 
3704 Difficulty: Hard


Given a non-empty binary search tree and a target value, find k values in the BST tha]]></description><category></category></item><item><title><![CDATA[leetcode 270: Closest Binary Search Tree Value]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48749493</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48749493</guid><author>xudli</author><pubDate>Sat, 26 Sep 2015 09:43:21 +0800</pubDate><description><![CDATA[Closest Binary Search Tree Value




Total Accepted: 
1815 Total Submissions: 
6418 Difficulty: Easy


Given a non-empty binary search tree and a target value, find the value in the BST that]]></description><category></category></item><item><title><![CDATA[leetcode 277: Find the Celebrity]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48749295</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48749295</guid><author>xudli</author><pubDate>Sat, 26 Sep 2015 09:04:47 +0800</pubDate><description><![CDATA[Find the Celebrity




Total Accepted: 
1126 Total Submissions: 
3603 Difficulty: Medium


Suppose you are at a party with n people (labeled from 0 to
n - 1) and among them, there may exist]]></description><category></category></item><item><title><![CDATA[leetcode 281: Zigzag Iterator]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48749219</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48749219</guid><author>xudli</author><pubDate>Sat, 26 Sep 2015 08:32:15 +0800</pubDate><description><![CDATA[Zigzag Iterator




Total Accepted: 
964 Total Submissions: 
2714 Difficulty: Medium


Given two 1d vectors, implement an iterator to return their elements alternately.
For example, given t]]></description><category></category></item><item><title><![CDATA[leetcode 280: Wiggle Sort]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48749155</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48749155</guid><author>xudli</author><pubDate>Sat, 26 Sep 2015 07:44:26 +0800</pubDate><description><![CDATA[Wiggle Sort




Total Accepted: 
1291 Total Submissions: 
3008 Difficulty: Medium


Given an unsorted array nums, reorder it in-place such that
nums[0] = nums[2] .
For example, given nums ]]></description><category></category></item><item><title><![CDATA[leetcode 286: Walls and Gates]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48748547</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48748547</guid><author>xudli</author><pubDate>Sat, 26 Sep 2015 06:09:33 +0800</pubDate><description><![CDATA[Walls and Gates




Total Accepted: 
411 Total Submissions: 
1365 Difficulty: Medium


You are given a m x n 2D grid initialized with these three possible values.

-1 - A wall or an obstac]]></description><category></category></item><item><title><![CDATA[leetcode 284: Peeking Iterator]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48701969</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48701969</guid><author>xudli</author><pubDate>Thu, 24 Sep 2015 02:18:04 +0800</pubDate><description><![CDATA[Peeking Iterator




Total Accepted: 
2156 Total Submissions: 
6859 Difficulty: Medium


Given an Iterator class interface with methods: next() and 
hasNext(), design and implement a Peekin]]></description><category></category></item><item><title><![CDATA[leetcode 283:  Move Zeroes]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48574521</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48574521</guid><author>xudli</author><pubDate>Sat, 19 Sep 2015 13:32:31 +0800</pubDate><description><![CDATA[Move Zeroes




Total Accepted: 
858 Total Submissions: 
1878 Difficulty: Easy


Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order o]]></description><category></category></item><item><title><![CDATA[leetcode 279: Perfect Squares]]></title><link>https://blog.youkuaiyun.com/xudli/article/details/48336861</link><guid>https://blog.youkuaiyun.com/xudli/article/details/48336861</guid><author>xudli</author><pubDate>Thu, 10 Sep 2015 06:03:01 +0800</pubDate><description><![CDATA[Perfect Squares
Total Accepted: 605 
Total Submissions: 1956 









Given a positive integer n, find the least number of perfect square numbers (for example,
1, 4, 9, 16, ...) which su]]></description><category></category></item></channel></rss>