摘要：
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],... 阅读全文
摘要：
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],... 阅读全文
摘要：
Given an index k, return the k th row of the Pascal's triangle.For example, given k = 3, Return[1,3,3,1].Note: Could you optimize your... 阅读全文
摘要：
Given an index k, return the k th row of the Pascal's triangle.For example, given k = 3, Return[1,3,3,1].Note: Could you optimize your... 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning o... 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning o... 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindro... 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindro... 阅读全文
摘要：
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down t... 阅读全文
摘要：
Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down t... 阅读全文