Algorithm
文章平均质量分 60
.
CH_whale
这个作者很懒,什么都没留下…
展开
-
蓝桥杯 算法提高 最小字符串
内存限制:256.0MB C/C++时间限制:2.0s Java时间限制:6.0s Python时间限制:10.0s。给定一些字符串(只包含小写字母),要求将他们串起来构成一个字典序最小的字符串。接下来n行,每行一个字符串(长度不超过100)。每组第一行一个正整数n,表示字符串个数。第一行T,表示有T组数据。T行,每行一个字符串。原创 2022-11-13 21:38:34 · 264 阅读 · 0 评论 -
蓝桥杯 算法训练 印章
共有n种图案的印章,每种图案的出现概率相同。小A买了m张印章,求小A集齐n种印章的概率。原创 2022-10-24 20:24:48 · 180 阅读 · 0 评论 -
6041. 多个数组求交集
给你一个二维整数数组 nums ,其中 nums[i] 是由 不同 正整数组成的一个非空数组,按 升序排列 返回一个数组,数组中的每个元素在 nums 所有数组 中都出现过。示例 1:输入:nums = [[3,1,2,4,5],[1,2,3,4],[3,4,5,6]]输出:[3,4]解释:nums[0] = [3,1,2,4,5],nums[1] = [1,2,3,4],nums[2] = [3,4,5,6],在 nums 中每个数组中都出现的数字是 3 和 4 ,所以返回 [3,4] 。原创 2022-04-24 12:22:39 · 488 阅读 · 0 评论 -
7-1 根据后序和中序遍历输出先序遍历 (25 分)
本题要求根据给定的一棵二叉树的后序遍历和中序遍历结果,输出该树的先序遍历结果。输入格式:第一行给出正整数N(≤30),是树中结点的个数。随后两行,每行给出N个整数,分别对应后序遍历和中序遍历结果,数字间以空格分隔。题目保证输入正确对应一棵二叉树。输出格式:在一行中输出 Preorder: 以及该树的先序遍历结果。数字间有1个空格,行末不得有多余空格。输入样例:72 3 1 5 7 6 41 2 3 4 5 6 7输出样例:Preorder: 4 1 3 2 6 5原创 2022-03-28 03:12:47 · 600 阅读 · 0 评论 -
7-3 输出全排列 (20 分)
请编写程序输出前n个正整数的全排列(n<10),并通过9个测试用例(即n从1到9)观察n逐步增大时程序的运行时间。输入格式:输入给出正整数n(<10)。输出格式:输入样例:3输出样例:123132213231312321代码:#include <iostream>using namespace std;int n, arr[10], visit[10];void dfs(int begin){ if(be原创 2022-03-28 03:08:41 · 3406 阅读 · 0 评论 -
B - Almost Rectangle
1. ProblemThere is a square field of sizen \times nn×nin which two cells are marked. These cells can be in the same row or column.You are to mark two more cells so that they are the corners of a rectangle with sides parallel to the coordinate axes....原创 2021-11-20 17:22:53 · 657 阅读 · 0 评论 -
A - Spy Detected
1. ProblemYou are given an arrayaaconsisting ofnn(n \ge 3n≥3) positive integers. It is known that in this array, all the numbers except one are the same (for example, in the array[4, 11, 4, 4][4,11,4,4]all numbers except one are equal to44).Prin...原创 2021-11-20 17:19:05 · 435 阅读 · 0 评论 -
5926. 买票需要的时间
有n个人前来排队买票,其中第0人站在队伍最前方,第(n - 1)人站在队伍最后方。给你一个下标从0开始的整数数组tickets,数组长度为n,其中第i人想要购买的票数为tickets[i]。每个人买票都需要用掉恰好 1 秒。一个人一次只能买一张票,如果需要购买更多票,他必须走到队尾重新排队(瞬间发生,不计时间)。如果一个人没有剩下需要买的票,那他将会离开队伍。返回位于位置k(下标从0开始)的人完成买票需要的时间(以秒为单位)。...原创 2021-11-14 13:56:16 · 552 阅读 · 0 评论 -
C - Carrying Conundrum
1. ProblemAlice has just learned addition. However, she hasn't learned the concept of "carrying" fully— instead of carrying to thenextcolumn, she carries to the columntwo columns to the left.For example, theregularway to evaluate the sum2039 +...原创 2021-11-14 12:01:14 · 598 阅读 · 0 评论 -
A - Domino Disaster
1. ProblemAlice has a grid with22rows andnncolumns. She fully covers the grid usingnndominoes of size1 \times 21×2— Alice may place them vertically or horizontally, and each cell should be covered by exactly one domino.Now, she decided to show...原创 2021-11-14 11:54:37 · 415 阅读 · 0 评论 -
A. Windblume Ode
1. ProblemA bow adorned with nameless flowers that bears the earnest hopes of an equally nameless person.You have obtained the elegant bow known as the Windblume Ode. Inscribed in the weapon is an array ofnn(n≥3n≥3) positivedistinctintegers (i.e. d...原创 2021-10-23 18:43:44 · 344 阅读 · 0 评论 -
E1. Permutation Minimization by Deque
1. ProblemIn fact, the problems E1 and E2 do not have much in common. You should probably think of them as two separate problems.A permutationppof sizennis given. Apermutationof sizennis an array of sizennin which each integer from11tonno...原创 2021-10-03 10:28:48 · 318 阅读 · 0 评论 -
A. Casimir‘s String Solitaire
1. ProblemCasimir has a stringsswhich consists of capital Latin letters 'A', 'B', and 'C' only. Each turn he can choose to do one of the two following actions:he can either erase exactly one letter 'A'andexactly one letter 'B' from arbitrary places...原创 2021-10-03 09:54:30 · 331 阅读 · 0 评论