linyx

2014年5月17日

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

posted @ 2014-05-17 16:11 linyx 阅读(173) 评论(0) 推荐(0)

Leetcode | Remove Duplicates from Sorted List I && II

摘要： Remove Duplicates from Sorted List IGiven a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->... 阅读全文

posted @ 2014-05-17 14:46 linyx 阅读(148) 评论(0) 推荐(0)

Leetcode | 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 o... 阅读全文

posted @ 2014-05-17 13:40 linyx 阅读(137) 评论(0) 推荐(0)

Leetcode | Reverse Nodes in k-Group

摘要： Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then le... 阅读全文

posted @ 2014-05-17 13:18 linyx 阅读(139) 评论(0) 推荐(0)

2014年5月16日

Leetcode | Unique Binary Search Trees I && II

摘要： Unique Binary Search Trees IGivenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a ... 阅读全文

posted @ 2014-05-16 15:25 linyx 阅读(157) 评论(0) 推荐(0)

Leetcode | Validate Binary Search Tree

摘要： Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n... 阅读全文

posted @ 2014-05-16 15:06 linyx 阅读(226) 评论(0) 推荐(0)

Leetcode | Remove Nth Node From End of List

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

posted @ 2014-05-16 13:53 linyx 阅读(156) 评论(0) 推荐(0)

2014年5月15日

Leetcode | Recover Binary Search Tree

摘要： Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is ... 阅读全文

posted @ 2014-05-15 21:50 linyx 阅读(280) 评论(0) 推荐(0)

Leetcode | Longest Substring Without Repeating Characters

摘要： Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文

posted @ 2014-05-15 16:51 linyx 阅读(182) 评论(0) 推荐(0)

Leetcode | First Missing Positive

摘要： Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm sho... 阅读全文

posted @ 2014-05-15 15:40 linyx 阅读(200) 评论(0) 推荐(0)

最宝贵的就是生命，生命对于每个人来说只有一次。人的一生应该这样度过：回首往事，他不会因为虚度年华而悔恨，也不会因为碌碌无为而羞愧！