发布时间：2015-06-30 13:17:40
注意： 先看第一个元素是否是target ，然后求后面的元素是target，最后求去掉第一个元素得到后面的结果是target-第一个的值<br />//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.<br />//<br />//Each number in C .........【阅读全文】
发布时间：2015-06-29 19:24:24
注意 char+int 得到的还是int值 直接加到结果字符串上面<br />可以使用：sBuilder.append(Integer.toString(count)+lastChar);<br />sBuilder.append(""+count+lastChar);<br />避免问题<br />//The count-and-say sequence is the sequence of integers beginning as follows:<br />//1, 11, 21, 1211, 111221, ...<b.........【阅读全文】
发布时间：2015-06-29 17:40:49
<p style="box-sizing:border-box;margin-top:0px;margin-bottom:10px;color:#333333;font-family:'Helvetica Neue', Helvetica, Arial, sans-serif;font-size:14px;line-height:30px;white-space:normal;background-color:#FFFFFF;">//Write a program to solve a Sudoku puzzle by filling the empty cells.<br />//<b.........【阅读全文】
发布时间：2015-06-27 19:10:44
//Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.<br />//<br />//The Sudoku board could be partially filled, where empty cells are filled with the character '.'.<br />//<br />//<br />//A partially filled sudoku which is valid.<br />//<br />//Note:<br />//A valid Sud.........【阅读全文】
发布时间：2015-05-29 14:23:16
//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 order of O(log n).////If the target is not found in the array, return [-1, -1].////For example,//Given [5, 7, 7, 8, 8, 10] and target value.........【阅读全文】
