li303491

2015年1月23日

摘要： Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文

posted @ 2015-01-23 17:59 li303491 阅读(156) 评论(0) 推荐(0) 编辑

Intersection of Two Linked Lists两链表找重合节点

摘要： Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a... 阅读全文

posted @ 2015-01-23 17:24 li303491 阅读(133) 评论(0) 推荐(0) 编辑

链表经典题Merge Two Sorted Lists

摘要： Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Hide Tags... 阅读全文

posted @ 2015-01-23 16:54 li303491 阅读(146) 评论(0) 推荐(0) 编辑

删除重复节点 Remove Duplicates from Sorted List

摘要： Given a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given1->1->2, return1->2.Given1->1->2->3->3, retu... 阅读全文

posted @ 2015-01-23 15:23 li303491 阅读(111) 评论(0) 推荐(0) 编辑

2014年11月22日

Permutations II 去掉重复的全排列

摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm... 阅读全文

posted @ 2014-11-22 19:08 li303491 阅读(316) 评论(0) 推荐(0) 编辑

2014年11月21日

Permutations 全排列回溯

摘要： Given a collection of numbers, return all possible permutations.For example,[1,2,3]have the following permutations:[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,... 阅读全文

posted @ 2014-11-21 23:58 li303491 阅读(214) 评论(0) 推荐(0) 编辑

Subsets II

摘要： Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.... 阅读全文

posted @ 2014-11-21 12:51 li303491 阅读(148) 评论(0) 推荐(0) 编辑

Subsets 集合子集回溯

摘要： Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co... 阅读全文

posted @ 2014-11-21 00:20 li303491 阅读(175) 评论(0) 推荐(0) 编辑

2014年11月20日

Sum Root to Leaf Numbers深度优先计算路径和

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

posted @ 2014-11-20 14:42 li303491 阅读(138) 评论(0) 推荐(0) 编辑

Path Sum II深度优先找路径

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文

posted @ 2014-11-20 13:55 li303491 阅读(138) 评论(0) 推荐(0) 编辑

公告