vercont

摘要： 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... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(112) 评论(0) 推荐(0)

摘要： Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.C++/** * Definition for a point. * ... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(138) 评论(0) 推荐(0)

摘要： Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.C++/** * Definition for a point. * ... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(119) 评论(0) 推荐(0)

摘要： Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example, Given[100, 4, 200, 1, 3... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(96) 评论(0) 推荐(0)

摘要： Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindro... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(98) 评论(0) 推荐(0)

摘要： Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindro... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(123) 评论(0) 推荐(0)

摘要： 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... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(88) 评论(0) 推荐(0)

摘要： Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning o... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(103) 评论(0) 推荐(0)

摘要： Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning o... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(112) 评论(0) 推荐(0)

摘要： 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],... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(151) 评论(0) 推荐(0)