Razer.Lu

2014年2月13日

摘要： Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should return length =5, and A is now[1,1,2,2,3]. 1 public class Solution { 2 public int removeDuplicates(int[] A) { 3 if(A == null || A.length == 0) 阅读全文

posted @ 2014-02-13 13:24 Razer.Lu 阅读(170) 评论(0) 推荐(0) 编辑

4Sum

摘要： Given an arraySofnintegers, are there elementsa,b,c, anddinSsuch thata+b+c+d= target? Find all unique quadruplets in the array which gives the sum of target.Note:Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie,a≤b≤c≤d)The solution set must not contain duplicate quadruplets. . 阅读全文

posted @ 2014-02-13 13:07 Razer.Lu 阅读(260) 评论(0) 推荐(0) 编辑

2014年2月12日

[Text Justification

摘要： Given an array of words and a lengthL, format the text such that each line has exactlyLcharacters and is fully (left and right) justified.You should pack your words in a greedy approach; that is, pack as many words as you can in each line. Pad extra spaces' 'when necessary so that each line 阅读全文

posted @ 2014-02-12 13:58 Razer.Lu 阅读(250) 评论(0) 推荐(0) 编辑

Count and Say

摘要： The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"two 1s"or21.21is read off as"one 2, thenone 1"or1211.Given an integern, generate thenthsequence.Note: The sequence of inte 阅读全文

posted @ 2014-02-12 12:29 Razer.Lu 阅读(197) 评论(0) 推荐(0) 编辑

Construct Binary Tree from Inorder and Postorder Traversal

摘要： Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.后续遍历根节点在最后一个元... 阅读全文

posted @ 2014-02-12 06:57 Razer.Lu 阅读(167) 评论(0) 推荐(0) 编辑

Construct Binary Tree from Preorder and Inorder Traversal

摘要： Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.ref:http://fish... 阅读全文

posted @ 2014-02-12 06:50 Razer.Lu 阅读(219) 评论(0) 推荐(0) 编辑

Minimum Window Substring

摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECODEBANC"T="ABC"Minimum window is"BANC".Note:If there is no such window in S that covers all characters in T, return the emtpy 阅读全文

posted @ 2014-02-12 03:29 Razer.Lu 阅读(306) 评论(0) 推荐(0) 编辑

Sort Colors

摘要： Given an array withnobjects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.Note:You are not suppose to use the l 阅读全文

posted @ 2014-02-12 01:16 Razer.Lu 阅读(207) 评论(0) 推荐(0) 编辑

2014年2月11日

Restore IP Addresses

摘要： Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.255.11.135", "255.255.111.35"]. (Order does not matter)ref:http://www.cnblogs.com/feiling/p/3301869.htmlpublic static Arr 阅读全文

posted @ 2014-02-11 16:21 Razer.Lu 阅读(149) 评论(0) 推荐(0) 编辑

Partition List

摘要： Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the original relative order of the nodes in each of the two partitions.For example,Given1->4->3->2->5->2andx= 3,return1->2->2->4->3- 阅读全文

posted @ 2014-02-11 15:01 Razer.Lu 阅读(213) 评论(0) 推荐(0) 编辑

公告