摘要：
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. 阅读全文
摘要：
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. 阅读全文
摘要：
The count-and-say sequence is the sequence of integers beginning as follows: 阅读全文
摘要：
Write a program to solve a Sudoku puzzle by filling the empty cells. 阅读全文
摘要：
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 order. 阅读全文
摘要：
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. 阅读全文
摘要：
Suppose a sorted array is rotated at some pivot unknown to you beforehand. 阅读全文
摘要：
Given a sorted array of integers, find the starting and ending position of a given target value. 阅读全文
摘要：
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. 阅读全文
摘要：
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. 阅读全文