摘要：
1、 Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to N 阅读全文
摘要：
1、Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] 阅读全文
摘要：
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文
摘要：
1、 Say you have an array for which the i th element is the price of a given stock on day i . If you were only permitted to complete at most one transa 阅读全文
摘要：
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, Return 6. 阅读全文
摘要：
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Pan 阅读全文
摘要：
Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that: For example, Given:start 阅读全文
摘要：
Word Ladder Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: For e 阅读全文