随笔分类 -  回溯

iPad游戏 Calcculator: The Game 程序自动计算求解方法
摘要：今天在iPad上下了个小游戏，主要是一个计算器的界面，有开始值，目标值，限定步数，以及一些加减乘除，还有作者脑洞想出来的功能键，主要有左移，直接把一个数加到末尾，将其中的某个数改为另一个数等等。。玩到20几关的时候感觉每道题要想一会儿才能解出来，于是有了下面的程序，写完程序就不想玩了。 游戏界面如下 阅读全文
posted @ 2018-08-25 01:10 丶Blank 阅读(621) 评论(0) 推荐(0)
N-Queens II——Leetcode
摘要：Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.计算N皇后的合法解的数量。解题思路：这次使用了更优化的... 阅读全文
posted @ 2015-09-16 15:46 丶Blank 阅读(157) 评论(0) 推荐(0)
Combination Sum III —— LeetCode
摘要：Find all possible combinations ofknumbers that add up to a numbern, given that only numbers from 1 to 9 can be used and each combination should be a u... 阅读全文
posted @ 2015-05-29 16:51 丶Blank 阅读(498) 评论(0) 推荐(0)
Combination Sum II —— LeetCode
摘要：Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文
posted @ 2015-05-29 16:18 丶Blank 阅读(145) 评论(0) 推荐(0)
Combination Sum —— LeetCode
摘要：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-05-29 14:32 丶Blank 阅读(148) 评论(0) 推荐(0)
Combinations ——LeetCode
摘要：Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3,4], [2,3],... 阅读全文
posted @ 2015-05-29 10:30 丶Blank 阅读(143) 评论(0) 推荐(0)
Permutations II ——LeetCode
摘要：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-05-28 10:11 丶Blank 阅读(162) 评论(0) 推荐(0)
Subsets —— LeetCode
摘要：Given a set of distinct integers,nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not... 阅读全文
posted @ 2015-05-19 11:52 丶Blank 阅读(161) 评论(0) 推荐(0)
Subsets II ——LeetCode
摘要：Given a collection of integers that might contain duplicates,nums, return all possible subsets.Note:Elements in a subset must be in non-descending ord... 阅读全文
posted @ 2015-05-01 17:06 丶Blank 阅读(173) 评论(0) 推荐(0)
Path Sum II——LeetCode
摘要：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2015-04-13 21:11 丶Blank 阅读(136) 评论(0) 推荐(0)
Generate Parentheses——LeetCode
摘要：Givennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))... 阅读全文
posted @ 2015-04-13 20:13 丶Blank 阅读(163) 评论(0) 推荐(0)
Palindrome Partitioning——LeetCode
摘要：Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv... 阅读全文
posted @ 2015-04-05 15:25 丶Blank 阅读(127) 评论(0) 推荐(0)