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 阅读(110) 评论(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 阅读(94) 评论(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 阅读(122) 评论(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 阅读(75) 评论(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 阅读(84) 评论(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)

摘要： Sort a linked list using insertion sort.C++/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode ... 阅读全文

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

摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up: Can you solve it without usin... 阅读全文

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

摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up: Can you solve it without usin... 阅读全文

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

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

posted @ 2018-09-21 11:34 vercont 阅读(150) 评论(0) 推荐(0)