2016年02月_luckyu1

原创 leetcode之Flatten Binary Tree to Linked List

题目： Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3 4 6 The flattened tree should look like:

2016-02-29 20:49:32 213

原创 leetcode之Perfect Squares

题目： Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12, return 3 because 12 = 4 + 4 + 4;

2016-02-29 16:29:49 247

原创 leetcode之linked List cycle && linked List cycle II

题目： linked list cycle： Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? linked list cycle II： Given a linked list, return

2016-02-29 14:46:25 189

原创 leetcode之 Kth Largest Element in an Array

题目： Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. For example, Given [3,2,1,5,6,4] and k = 2, r

2016-02-29 13:55:58 174

原创 leetcode之Search in Rotated Sorted Array

题目： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in the ar

2016-02-28 22:27:22 146

原创 leetcode之 Sum Root to Leaf Numbers

题目： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find

2016-02-28 12:48:02 228

原创 leetcode之Remove Duplicates from Sorted Array II

题目： 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

2016-02-28 12:40:32 138

原创 leetcode之Super ugly number

题目: Write a program to find the nth super ugly number. Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4,

2016-02-28 11:57:05 263

原创 leetcode之H-index &&H-index II

题目略，思想相同解答：主要就是先排序，然后找到最大的h，在找最大的过程中，可以建模称为一个线相交题目经过分析可以发现，最大h就是citation这个数组和size - pos（pos是数组下标，size是数组的大小）这两个线连接起来的交点 1.两条线确实有交点，并且交点的横坐标是x，那么这个时候就直接h就是size - x 2.有交点，但是交点的横坐标不是整数，这个时候就是距离交

2016-02-28 10:23:08 206

原创 leetcode之Binary Search Tree Iterator

题目： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return the next smallest number in the BST. Not

2016-02-27 10:36:49 152

原创 leetcode之first bad version

题目： You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed bas

2016-02-23 17:50:43 186

luckyu1的博客