vercont

摘要： 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 阅读(114) 评论(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 阅读(128) 评论(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 阅读(105) 评论(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 阅读(128) 评论(0) 推荐(0)

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

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

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

posted @ 2018-09-22 10:58 vercont 阅读(91) 评论(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 阅读(147) 评论(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 阅读(136) 评论(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 阅读(113) 评论(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 阅读(118) 评论(0) 推荐(0)