NealCaffrey989 - 博客园

2015年6月16日

摘要： Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文

posted @ 2015-06-16 22:02 NealCaffrey989 阅读(146) 评论(0) 推荐(0) 编辑

[LeetCode] #37 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"tw... 阅读全文

posted @ 2015-06-16 21:56 NealCaffrey989 阅读(110) 评论(0) 推荐(0) 编辑

[LeetCode] #37 Sudoku Solver

摘要： Write a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character'.'.You may assume that there will be on... 阅读全文

posted @ 2015-06-16 10:28 NealCaffrey989 阅读(120) 评论(0) 推荐(0) 编辑

[LeetCode] #36 Valid Sudoku

摘要： Determine if a Sudoku is valid, according to:Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with ... 阅读全文

posted @ 2015-06-16 10:24 NealCaffrey989 阅读(132) 评论(0) 推荐(0) 编辑

2015年6月15日

[LeetCode] #35 Search Insert Position

摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or... 阅读全文

posted @ 2015-06-15 21:37 NealCaffrey989 阅读(109) 评论(0) 推荐(0) 编辑

[LeetCode] #34 Search for a Range

摘要： Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文

posted @ 2015-06-15 21:33 NealCaffrey989 阅读(184) 评论(0) 推荐(0) 编辑

[LeetCode] #33 Search 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).You are given a target value t... 阅读全文

posted @ 2015-06-15 12:09 NealCaffrey989 阅读(150) 评论(0) 推荐(0) 编辑

[LeetCode] #32 Longest Valid Parentheses

摘要： Given a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses substring.For"(()", the longest... 阅读全文

posted @ 2015-06-15 11:27 NealCaffrey989 阅读(142) 评论(0) 推荐(0) 编辑

[LeetCode] #31 Next Permutation

摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl... 阅读全文

posted @ 2015-06-15 11:11 NealCaffrey989 阅读(118) 评论(0) 推荐(0) 编辑

2015年6月14日

[LeetCode] #30 Substring with Concatenation of All Words

摘要： You are given a string,s, and a list of words,words, that are all of the same length. Find all starting indices of substring(s) insthat is a concatena... 阅读全文

posted @ 2015-06-14 21:08 NealCaffrey989 阅读(144) 评论(0) 推荐(0) 编辑