2016年02月_白雪忆青竹

原创 [leetcode] 334. Increasing Triplet Subsequence

题目： Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should: Return true if there exists i, j, k such that arr[i] < arr[

2016-02-27 11:19:29 514

原创 [leetcode] 310. Minimum Height Trees

题目： For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called

2016-02-23 15:56:23 697

原创 [leetcode] 309. Best Time to Buy and Sell Stock with Cooldown

题目： Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on

2016-02-22 11:40:30 2236 2

原创 [leetcode] 306. Additive Number

题目： Additive number is a string whose digits can form additive sequence.A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the

2016-02-21 11:29:26 977

原创 [leetcode] 299. Bulls and Cows

题目： You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint

2016-02-21 11:13:20 393

原创 [leetcode] 304. Range Sum Query 2D - Immutable

题目： Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).Range Sum Query 2D The above rectangl

2016-02-18 15:34:41 350

原创 [leetcode] 301. Remove Invalid Parentheses

题目： Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.Note: The input string may contain letters other than the parentheses ( and ).

2016-02-18 10:44:15 1297

原创 [leetcode] 300. Longest Increasing Subsequence

题目： Given an unsorted array of integers, find the length of longest increasing subsequence.For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101], ther

2016-02-17 20:08:36 434

原创 [leetcode] 295. Find Median from Data Stream

题目：Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples: [2,3,4] , the median i

2016-02-04 10:26:38 523

u014673347的专栏