vercont

摘要： 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 阅读(131) 评论(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 阅读(109) 评论(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 阅读(83) 评论(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 阅读(105) 评论(0) 推荐(0) 编辑

摘要： Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?C++/** * Definition for s... 阅读全文

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

摘要： Given a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?C++/** * Definition for s... 阅读全文

posted @ 2018-09-22 10:58 vercont 阅读(139) 评论(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 阅读(111) 评论(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 阅读(72) 评论(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 阅读(157) 评论(0) 推荐(0) 编辑

摘要： There are N gas stations along a circular route, where the amount of gas at station i isgas[i].You have a car with an unlimited gas ta... 阅读全文

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