10 2017 档案

[LintCode] Linked List Cycle
摘要：Given a linked list, determine if it has a cycle in it. Given a linked list, determine if it has a cycle in it. Given a linked list, determine if it h 阅读全文
posted @ 2017-10-13 12:42 Review->Improve 阅读(198) 评论(0) 推荐(0)
[LintCode] Merge Two Sorted Lists
摘要：Merge two sorted (ascending) linked lists and return it as a new sorted list. The new sorted list should be made by splicing together the nodes of the 阅读全文
posted @ 2017-10-13 12:27 Review->Improve 阅读(147) 评论(0) 推荐(0)
[LintCode] Partition List
摘要：Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the 阅读全文
posted @ 2017-10-13 12:16 Review->Improve 阅读(258) 评论(0) 推荐(0)
[LintCode] Insertion Sort List
摘要：Sort a linked list using insertion sort. Sort a linked list using insertion sort. Sort a linked list using insertion sort. Example Given 1->3->2->0->n 阅读全文
posted @ 2017-10-13 11:47 Review->Improve 阅读(173) 评论(0) 推荐(0)
[LintCode] Insert into a Cyclic Sorted List
摘要：Given a node from a cyclic linked list which has been sorted, write a function to insert a value into the list such that it remains a cyclic sorted li 阅读全文
posted @ 2017-10-13 11:16 Review->Improve 阅读(215) 评论(0) 推荐(0)
[GeeksForGeeks] Perfect Binary Tree
摘要：Given a Binary Tree, write a function to check whether the given Binary Tree is a prefect Binary Tree or not. A Binary tree is Perfect Binary Tree in 阅读全文
posted @ 2017-10-10 05:16 Review->Improve 阅读(301) 评论(0) 推荐(0)
[GeeksForGeeks] Check sum of covered and uncovered nodes of binary tree
摘要：Given a binary tree, you need to check whether sum of all covered elements is equal to sum of all uncovered elements or not. In a binary tree, a node 阅读全文
posted @ 2017-10-10 04:45 Review->Improve 阅读(408) 评论(0) 推荐(0)
[GeeksForGeeks] Find subarray with given sum
摘要：Given an unsorted array of nonnegative integers, find a continous subarray which adds to a given number. Examples: There may be more than one subarray 阅读全文
posted @ 2017-10-03 04:02 Review->Improve 阅读(498) 评论(0) 推荐(0)
[GeeksForGeeks] Generate all root to leaf paths of a binary tree
摘要：Given a binary tree, generate all root to leaf paths of a binary tree. Example: Example Tree The output for the above example is [[1, 2, 4], [1, 2, 5] 阅读全文
posted @ 2017-10-03 00:34 Review->Improve 阅读(189) 评论(0) 推荐(0)