- 博客(24)
- 收藏
- 关注
原创 保研面试 英文算法题 临时抱佛脚训练思路系列——搜索专题
专题二 DFS与BFSA1103 Integer FactorizationThe K−P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K−P factorization of N for any positive integers N, K
2020-09-18 14:11:06 277
原创 保研面试 英文算法题 临时抱佛脚训练思路系列——动态规划
专题一 动态规划A1007 Maximum Subsequence SumGiven a sequence of K integers { N1N_1N1 , N2N_2N2 , …, NKN_KNK }. A continuous subsequence is defined to be { NiN_iNi , Ni+1N_{i+1}Ni+1 , …, NjN_jNj } where 1≤i≤j≤K. The Maximum
2020-09-16 20:10:52 635
原创 《算法笔记》Codeup练习 11.3小节 最长不下降子序列(LIS)
问题A 最长不下降子序列(LIS)题目大意给定一个序列,求其不下降子序列的最大长度。(子序列不要求连续)思路动态规划dp[i]=max{dp[j]+1,dp[i]}dp[i]初始化全为1代码#include <iostream>#include <cstdio>using namespace std;int main(int argc, const char * argv[]) { int N; int num[1001],dp[1001];
2020-08-12 23:49:35 172
原创 PAT自主训练记录 甲级A1007 Maximum Subsequence Sum
A1007 Maximum Subsequence Sum(25分)题目描述Given a sequence of K integers { N1N_1N1 , N2N_2N2 , …, NKN_KNK }. A continuous subsequence is defined to be { NiN_iNi , Ni+1N_{i+1}Ni+1 , …, NjN_jNj } where 1≤i≤j≤K. The Maximum Su
2020-08-11 17:57:43 136
原创 《算法笔记》Codeup练习 11.2小节 最大连续子序列和
问题A 最大连续子序列和题目大意给定一串数列,求其连续自序列的和最大值,并输出自序列的起始和结束端的数值。思路考虑到要输出自序列的两端数值,采用结构体。有三个属性:value:该位置的数字startV:以该位置为结尾的连续子序列和最大的子序列的开始值dp:以该位置为结尾的连续子序列和的最大值利用动态规划的思想,dp[i]=max{dp[i-1]+num[i-1],num[i-1]}、dp[0]=num[0],同时根据具体情况更新startV的值。注意当序列里的数字都是负数时,最大和输
2020-08-11 17:38:12 153
原创 《算法笔记》Codeup练习 11.1小节 动态规划的递归写法和递推写法
问题A Fibonacci题目大意给一个数n,求它的斐波拉契数的结果。思路有好几种做法,这里就用动态规划的递归写法吧。过程中犯的错误这题似乎是多组测试数据,不是一组,刚开始当一组写了。初始化dp数组值为-1时,不可以直接 int dp[31]={-1};需要用循环来初始化。代码#include <cstdio>#include <iostream>using namespace std;int dp[31];int Fibonacci(int n){
2020-08-10 16:40:07 128
原创 PAT自主训练记录 甲级A1049 Counting Ones
A1049 Counting Ones(30分)题目描述The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1’s in 1, 10, 11, and 12.Input
2020-08-10 10:48:10 136
原创 PAT自主训练记录 乙级B1008 数组元素循环右移问题
B1008 数组元素循环右移问题(20分)题目描述一个数组A中存有N(>0)个整数,在不允许使用另外数组的前提下,将每个整数循环向右移M(≥0)个位置,即将A中的数据由(A0A_0A0A1A_1A1⋯AN−1A_{N−1}AN−1)变换为(AN−MA_{N−M}AN−M⋯AN−1A_{N−1}AN−1A0A_0A0A1A_1A1⋯AN−M−1A_{N−M−1}AN−M−1)(最后M个数循环移至最前面的M个位置)。如果需
2020-08-07 16:04:01 114
原创 PAT自主训练记录 甲级A1008 Elevator
A1008 Elevator(20分)题目描述The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up on
2020-08-06 18:48:36 142
原创 PAT自主训练记录 甲级A1104/乙级B1049 数列的片段和
A1104 Sum of Number Segments(20分)附有详细解释以及代码的博文链接:https://blog.csdn.net/qq_21394327/article/details/106975016点击跳转题目描述Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2
2020-08-05 23:55:28 845
原创 《算法笔记》Codeup练习 5.2小节 最大公约数与最小公倍数
问题A Least Common Multiple题目大意多组测试数据,每组数据占一行。每行第一个数据m代表这组有m的数求最小公倍数,后接m个数值。思路循环输入m个数,用一个变量记录当前的最小公倍数,之后每输入一个就与当时的最小公倍数变量一起求最小公倍数。这题的测试数据应该是默认数据按照递增输入的,同时也就顺便保证了当前的最小公倍数比即将输入的数值小。代码#include <iostream>#include <stdio.h>#include <algor
2020-08-05 15:42:52 184
原创 《算法笔记》Codeup练习 5.1小节 简单数学问题
问题A 守形数题目大意给一个整数N(2≤N<100),判断N平方后的数的地位部分是否为N。例:25225^2252=625,低位部分是25,则25是守形数。思路首先得出N的位数w,接着用N对10m10^m10m求余,判断余数是否等于N。代码#include <iostream>#include<stdio.h>#include<cstdio>#include<math.h>#include<algorithm>using n
2020-08-05 11:18:03 460
原创 《算法笔记》Codeup练习 4.7小节 其他高技巧与算法
问题A 找第K大数题目大意给定一个长度为n(1≤n≤1,000,000)的无序正整数序列,以及另一个数k(1≤k≤1,000,000)(关于第k大的数:例如序列{1,2,3,4,5,6}中第3大的数是4。)注意这题可以选择把数字排序之后,输出第k个数字(这样也是可以通过的)不过有更有的解法——随机选择。有个快排的思想在里面。#include<stdio.h>#include<cstdio>#include<iostream>#include<cm
2020-08-04 13:40:39 221
原创 PAT自主训练记录 甲级1093 Count PAT‘s
A1093 Count PAT’S(25分)题目描述The string APPAPT contains two PAT’s as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.Now given any string, you are sup
2020-08-04 13:33:07 168
原创 PAT自主训练记录 甲级1069/乙级1019 The Black Hole of Numbers
1069 The Black Hole of Numbers(20分)题目描述For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by taking the second nu
2020-08-04 13:16:47 159
原创 《算法笔记》Codeup练习 4.6小节 two pointers
问题A 二路归并排序(mergeSort)递归法题目大意就是最基础的递归二路归并排序的算法思想。注意这题测试结果Runtime Error80就是正确的。//// main.cpp// 二路归并排序(mergesort)递归法//// Created by JustforStar on 2020/7/25.// Copyright © 2020 JustforStar. All rights reserved.//#include<stdio.h>#includ
2020-07-25 21:39:56 247
原创 PAT自主训练记录 甲级1029 Median
1029 Median(25分)题目描述Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1 = { 11, 12, 13, 14 } is 12, and the median of S2 = { 9, 10, 15, 16, 17 } is 15. The median of two sequences i
2020-07-24 15:53:16 113
原创 PAT自主训练记录 甲级1044 Shopping in Mars
1044 Shopping in Mars (25分)题目描述Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). When making the payment, the ...
2020-04-29 01:00:46 194
原创 PAT自主训练记录 甲级1048 Find Coins
1048 Find Coins (25分)题目描述Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of ...
2020-04-28 09:31:33 131
原创 PAT自主训练记录 甲级A1085/乙级B1030 Perfect Sequence/完美数列
A1085 Perfect Sequence (25分)题目描述Given a sequence of positive integers and another positive integer p. The sequence is said to be a perfect sequence if M≤m×p where M and m are the maximum and minimum...
2020-04-27 09:47:04 208
原创 《算法笔记》Codeup练习 4.5小节 二分
问题A 找x题目大意给出一组互不相同的数,在其中找出指定某个数的下标位置,若找不到则输出-1思路本题数据量不大,可以直接用遍历查找鉴于这是在二分下面的题目,也可以用二分做过程中犯的错误一开始因为被小结名称——二分给影响了,一心使用二分。就想当然的排序,之后二分查找,提交错了好多遍都没意识到自己已经把数字的原顺序给改变了。有被自己蠢到代码1 遍历//输入一个数n,然后输入n个数值...
2020-04-21 22:45:29 154
原创 《算法笔记》Codeup练习 4.4小节 贪心
问题A 看电视题目大意给若干个电视节目的开始和结束时间,求最多能够完整的看完多少个电视节目题目思路:区间贪心#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#include<math.h>using namespace st...
2020-04-17 19:14:35 260
原创 PAT自主训练记录 甲级1038 Recover the Smallest Number
1038 Recover the Smallest Number (30分)题目描述Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given { 32, 321, 3214, 0229, 87 }, we can rec...
2020-04-15 13:26:31 151
原创 PAT自主训练记录 甲级1037 Magic Coupon
1037 Magic Coupon (25分)题目描述The magic shop in Mars is offering some magic coupons. Each coupon has an integer N printed on it, meaning that when you use this coupon with a product, you may get N time...
2020-04-14 22:05:06 224
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人