LeetCode
hssyang
这个作者很懒,什么都没留下…
展开
-
Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()()原创 2015-03-14 03:38:29 · 270 阅读 · 0 评论 -
Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1 3原创 2015-03-14 03:35:50 · 458 阅读 · 0 评论 -
Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3tips:注意为负数的情况!!!原创 2015-03-14 03:37:57 · 282 阅读 · 0 评论 -
Max Points on a Line
https://leetcode.com/problems/max-points-on-a-line/Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.思路1:一开始想着构造ax+by+c=0的方程,额,好像也可以。。。O(原创 2015-04-06 16:35:17 · 329 阅读 · 0 评论 -
Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on原创 2015-03-14 03:37:53 · 283 阅读 · 0 评论 -
3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c原创 2015-04-30 19:09:20 · 417 阅读 · 0 评论 -
Word Ladder
Given two words (beginWord and endWord), and a dictionary, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at a timeEach i原创 2015-04-30 19:11:50 · 274 阅读 · 0 评论 -
Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.思路1:最笨的方法,每次插入然后调整思路2:由于是升序有序的,所以子树的根节点必然是中间的那个数,所以可以通过找到子链表的中间节点,两边递归实现找到链表中间节原创 2015-04-30 19:12:53 · 295 阅读 · 0 评论 -
Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.思路:如果要知道多少个0,就需要找到他们的约数中,有多少个2和5,由于2的个数必多于5,所以,找到5的个数即可思原创 2015-05-15 12:48:44 · 240 阅读 · 0 评论