递归
PKU_CXK
北京大学信息科学技术学院
展开
-
LeetCode | 47. Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1,1]]思路一:原创 2017-06-29 23:56:19 · 273 阅读 · 0 评论 -
POJ 2255:重建二叉树
http://bailian.openjudge.cn/practice/2255/思路在前序中找到根节点(每个前序串的第一个字符),然后在中序串中找到根节点的位置。前半部分是左子树,后半部分是右子树,递归输出。#include <iostream>#include <cstdio>using namespace std;string front,...原创 2018-07-07 17:21:43 · 504 阅读 · 0 评论 -
POJ 1011 Sticks(搜索问题)
题目链接 http://bailian.openjudge.cn/practice/1011/思路一(TLE): 输入数据时,计算出需要枚举的原始棍子长度的上界下界,然后枚举。对每一个stick,将他归到某一组棍子中(如果当前枚举的原始棍子长度为i,一组棍子的总和就应该恰好是i),然后搜索。#include <iostream>#include <algorithm...原创 2018-04-17 21:41:48 · 375 阅读 · 0 评论 -
POJ 2479 分解因数
题目链接 http://bailian.openjudge.cn/practice/2749/#include <iostream>#include <cstdio>using namespace std;int f(int begin, int tot){ int res = 1; // 自己本身就是1个 if(beg...原创 2018-04-17 19:58:46 · 679 阅读 · 0 评论 -
POJ 4001 抓住那头牛(广度优先搜索)
题目链接 http://bailian.openjudge.cn/practice/4001/#include <iostream>#include <queue>#include <cstdio>using namespace std;int N, K;int vis[201000];struct point{ int p...原创 2018-04-17 19:57:02 · 686 阅读 · 0 评论 -
LeetCode | 78. Subsets
Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3], [1], [2], [1,2原创 2017-09-07 10:58:02 · 346 阅读 · 0 评论 -
LeetCode | 77. Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 … n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]Solution递归原创 2017-09-06 11:42:08 · 292 阅读 · 0 评论 -
LeetCode | 70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a positive inte原创 2017-08-03 00:56:09 · 334 阅读 · 0 评论 -
LeetCode | 60. Permutation Sequence——第K个全排列
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""312""321"原创 2017-07-06 22:50:42 · 521 阅读 · 0 评论 -
LeetCode | 46. Permutations
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]题意:给出几原创 2017-06-28 09:16:45 · 314 阅读 · 0 评论 -
LeetCode 87. Scramble String
https://leetcode.com/problems/scramble-string/DescriptionGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible rep...原创 2019-02-13 15:14:37 · 173 阅读 · 0 评论