摘要: http://oj.leetcode.com/problems/combination-sum/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 same repeated number may be chosen from C unlimited number of times.Note:All numbers (including target) will be po 阅读全文
posted @ 2013-11-04 18:11 移山测试工作室黑灯老师 阅读(789) 评论(0) 推荐(0) 编辑
摘要: http://oj.leetcode.com/problems/count-and-say/The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off as "one 2, then one 1" or 1211.Given an i 阅读全文
posted @ 2013-11-04 13:42 移山测试工作室黑灯老师 阅读(368) 评论(0) 推荐(0) 编辑
摘要: http://oj.leetcode.com/problems/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 only one unique solution.A sudoku puzzle......and its solution numbers marked in red.思路:和前面一题Vali 阅读全文
posted @ 2013-11-04 10:55 移山测试工作室黑灯老师 阅读(3695) 评论(0) 推荐(0) 编辑
count website visits
Buy Computers