vercont

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For exampl... 阅读全文

posted @ 2018-09-24 18:11 vercont 阅读(159) 评论(0) 推荐(0)

摘要： Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(110) 评论(0) 推荐(0)

摘要： Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(101) 评论(0) 推荐(0)

摘要： Sort a linked list in O(n log n) time using constant space complexity.C++/** * Definition for singly-linked list. * struct ListNode { ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(129) 评论(0) 推荐(0)

摘要： Sort a linked list in O(n log n) time using constant space complexity.C++/** * Definition for singly-linked list. * struct ListNode { ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(108) 评论(0) 推荐(0)

摘要： Given an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(74) 评论(0) 推荐(0)

摘要： Given an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(112) 评论(0) 推荐(0)

摘要： Given an array of integers, every element appears three times except for one. Find that single one.Note: Your algorithm should have a ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(76) 评论(0) 推荐(0)

摘要： Given an array of integers, every element appears three times except for one. Find that single one.Note: Your algorithm should have a ... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(153) 评论(0) 推荐(0)

摘要： Given a singly linked list L: L 0→L 1→…→L n-1→L n, reorder it to: L 0→L n →L 1→L n-1→L 2→L n-2→…You must do this in-place without alte... 阅读全文

posted @ 2018-09-23 00:41 vercont 阅读(165) 评论(0) 推荐(0)