amazingzoe - 博客园

2015年10月30日

摘要： Given a sorted integer array without duplicates, return the summary of its ranges.For example, given[0,1,2,4,5,7], return["0->2","4->5","7"].Runtime: ... 阅读全文

posted @ 2015-10-30 00:29 amazingzoe 阅读(166) 评论(0) 推荐(0)

2015年10月19日

Move Zeroes

摘要： Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.For example, givenn... 阅读全文

posted @ 2015-10-19 11:27 amazingzoe 阅读(145) 评论(0) 推荐(0)

2015年10月13日

Combinations

摘要： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: [ [2,4], [3,4 阅读全文

posted @ 2015-10-13 05:06 amazingzoe 阅读(136) 评论(0) 推荐(0)

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 @ 2015-10-13 04:25 amazingzoe 阅读(161) 评论(0) 推荐(0)

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

posted @ 2015-10-13 02:20 amazingzoe 阅读(245) 评论(0) 推荐(0)

Nim Game

摘要： You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 ston... 阅读全文

posted @ 2015-10-13 02:04 amazingzoe 阅读(134) 评论(0) 推荐(0)

Find Minimum in Rotated Sorted Array II

摘要： Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Suppose a sort... 阅读全文

posted @ 2015-10-13 00:59 amazingzoe 阅读(131) 评论(0) 推荐(0)

Letter Combinations of a Phone Number

摘要： Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文

posted @ 2015-10-13 00:20 amazingzoe 阅读(192) 评论(0) 推荐(0)

2015年10月12日

Generate Parentheses

摘要： Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文

posted @ 2015-10-12 23:36 amazingzoe 阅读(180) 评论(0) 推荐(0)

Find Minimum in Rotated Sorted Array

摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文

posted @ 2015-10-12 09:38 amazingzoe 阅读(106) 评论(0) 推荐(0)

公告