DonaldY的博客_【OJ】

【PAT】1021. Deepest Root (25)

题目链接：https://www.patest.cn/contests/pat-a-practise/1021 A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supp

PAT

dfs

并查集

#include

连通图

原创 2022-10-21 16:12:49 36 阅读

【PAT】1019. General Palindromic Number (20)

题目链接： https://www.patest.cn/contests/pat-a-practise/1019 A number that will be the same when it is written forwards or backwards is kmic Number. For example, 1234321 is a p

PAT

进制转换

回文

进制

16进制

原创 2022-10-21 16:12:38 54 阅读

【PAT】1025. PAT Ranking (25)

题目链接：https://www.patest.cn/contests/pat-a-practise/1025 Programming Ability Test (PAT) is organized by the College of Computer Science and Technoach test is sup

PAT

#include

git

sed

原创 2022-10-21 16:12:33 30 阅读

【PAT】1029. Median (25)

题目链接：https://www.patest.cn/contests/pat-a-practise/1029 Given an increasing sequence S of N integers, the median is the numbe, the median of S1={11, 12,

PAT

i++

中位数

#include

原创 2022-10-21 16:12:25 44 阅读

算法提高快乐司机

/** 2017.3.25 Donald*//** 思路：不用dp，直接按其价值比，从高到底堆积。*/#include<bits/stdc++.h>using na

蓝桥杯

算法

#include

c++

#define

原创 2022-10-21 16:11:25 31 阅读

1002. A+B for Polynomials (25)

/** 2017.2.27 Donald*//** 多项式求和系数过小不要*/#include<cstdio>using namespace std;#define MAXN 1001#define EPS 1e-8double A[MAXN];int K;int main(void){ int T = 2; int n, cnt

PAT

#define

#include

多项式

原创 2022-10-21 16:11:21 32 阅读

1003. Emergency (25)

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities cach city and the le

PAT

1003

#define

#include

提交代码

原创 2022-10-21 16:11:18 31 阅读

04-树6 Complete Binary Search Tree (30分)

感觉好行思路正确但对递归和运用树的知识掌握不够，仍需要努力啊！！！题意：根据

#include

递归

子树

原创 2022-10-21 16:11:14 17 阅读

1001. A+B Format (20)

/** 2017.2.26 Donald*///1001. A+B Format (20)/** 思路：若大于4位，每过3位（7 和 4），则用逗号隔开；否则不用*/#include<cstdio>

PAT

#include

原创 2022-10-21 16:10:54 4 阅读

1012. The Best Rank (25)

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Pralculus or Linear Algebra), and E - Engl

PAT

#include

git

ios

原创 2022-10-21 16:10:33 62 阅读

1009. Product of Polynomials (25)

This time, you are supposed to find A*B where A and B are two polynomials.Input Specification:Each input file contains one test cass the information

PAT

1009

#define

sed

数组

原创 2022-10-21 16:10:26 53 阅读

01-复杂度2 Maximum Subsequence Sum

题目：https://pta.patest.cn/pta/test/1342/exam/4/question/18204题意：　　输入K个数，找

子串

#include

原创 2022-10-21 16:10:15 10 阅读

04-树7 二叉搜索树的操作集 (30分)

提交：https://pta.patest.cn/pta/test/1342/exam/3/question/20490#include <stdio.h>#includuct TNode{ Ele

子节点

i++

#include

原创 2022-10-21 16:09:51 16 阅读

06-图2 Saving James Bond - Easy Version (25分)

题目链接：https://pta.patest.cn/pta/test/1342/exam/4/question/22501题意　　小岛半径15，007能跳 D 远，就是在

dfs

#include

递归

#define

原创 2022-10-21 16:09:43 30 阅读

06-图1 列出连通集

sing namespace std;int N,

#include

初始化

二维数组

原创 2022-10-21 16:09:26 79 阅读

06-图3 六度空间 (30分)

题目链接：https://pta.patest.cn/pta/test/1342/exam/4/question/22502 思路：注意层数判断即需要last tail 进行判断codeblock 快捷键ctrl+shift+c可以快速注释掉多行。ctrl+shift+x可以取消注释#include<cstdio>#include<cstring>#include

六度空间

#include

结点

快捷键

原创 2022-10-21 16:09:20 37 阅读

03-树2 List Leaves (25分)

层序遍历题意:　　找到叶子节点从上到下从左到右输出叶子节点思路：　　用一个队列来模拟坑点：　　最后输出格式要注意最后一个没有空格#include<cstdio>#include<queue>using namespace std;#define MaxTree 10#define ElementType char#define Tree int#define Null -1queu

#define

子节点

#include

原创 2022-10-21 16:09:06 78 阅读

02-线性结构4 Pop Sequence (25分)

栈的运用解题思路：　　用一个栈来模拟　　1。栈为空时判断需要填入的数是否小于栈的容量(即M)　　2。若后一个数比前一个数

栈

用例

#include

栈容量

原创 2022-10-21 16:09:02 72 阅读

02-线性结构1 两个有序链表序列的合并 (15分)

题目：https://pta.patest.cn/pta/test/1342/exam/3/question/19208注意　　提交时候只需要把Merge的函数提交即可#include <stdio.h>#include <stdlib.h>typedef int ElementType;typedef struct Node *PtrToNode;struct Node { Ele

链表

合并

结构

#include

初始化

原创 2022-10-21 16:08:52 23 阅读

UVA 11809

= C * 10^D　　取对数　　log10(A)

#include

二进制数

大整数

原创 2022-10-21 16:08:51 86 阅读

UVa Box 1587

水题注意点：· 长宽不等 · 三组不同 · 三个不同的面两两包含共同边#include<cstdio>#include<cstring>#include<algorith

#include

原创 2022-10-21 16:07:40 51 阅读

UVa10340 All in All

水题坑点：边读边判断。#include<cstdio>#include<cstring>#define MAXN 1010char s[MAXN], t[MAXN];void solve(){ while((c = getchar()) != '\n'){ if(c == t[i])

#include

i++

#define

原创 2022-10-21 16:07:37 42 阅读

最大连续子序列和（小结）

解决最大子序列有如下几种。1. 暴力求解 o(n^3) 2. 暴力求解(优化点) o(n^2)以上两种也是最容易想到的，这

ide

最大子列和

递归

原创 2022-10-21 16:06:47 52 阅读

蓝桥杯历届试题---蚂蚁感冒

水题 #include#includeusing namespace std;#define MAX_N 105int N;int a[MAX_N];int cnt = 1;void solve(){ bool flag = fal0){ //朝右 for

#include

ios

#define

原创 2022-10-21 16:06:28 46 阅读

1005. Spell It Right (20)

Spell It Right (20)Given a non-negative integer N, your task is to compute the sum of all th

PAT

git

#include

倒序

原创 2022-10-21 16:06:22 36 阅读

1006. Sign In and Sign Out (25)

At the beginning of every day, the first person who signs in the computer room will unlock

PAT

#include

sed

原创 2022-10-21 16:06:18 43 阅读

1008. Elevator (20)

The highest building in our city has only one elevator. A request list is made up with N posit

PAT

#include

原创 2022-10-21 16:06:12 38 阅读

【蓝桥杯】算法提高夺宝奇兵

/** 题意：题意不明，实则是，上一条路能选他对应下一条和他下一条的右边那一条。

算法

蓝桥杯

夺宝奇兵

dp

#include

原创 2022-10-21 16:06:08 55 阅读

树状数组------冒泡排序的交换次数

题意：给定一个1~n的排列a0, a1, a2, ..., an-1, 求对这个数列进行冒泡排序所需要的交换次序(冒泡排序是每次找到满足ai > a

树状数组

冒泡排序

逆序数

原创 2022-10-21 16:05:55 39 阅读

1011. World Cup Betting (20)

With the 2010 FIFA World Cup running, football fans the world over were becoming increasingfrica. Sim

PAT

#include

ios

ide

原创 2022-10-21 16:05:47 52 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

11398026

【PAT】1021. Deepest Root (25)

【PAT】1019. General Palindromic Number (20)

【PAT】1025. PAT Ranking (25)

【PAT】1029. Median (25)

算法提高快乐司机

1002. A+B for Polynomials (25)

1003. Emergency (25)

04-树6 Complete Binary Search Tree (30分)

1001. A+B Format (20)

1012. The Best Rank (25)

1009. Product of Polynomials (25)

01-复杂度2 Maximum Subsequence Sum

04-树7 二叉搜索树的操作集 (30分)

06-图2 Saving James Bond - Easy Version (25分)

06-图1 列出连通集

06-图3 六度空间 (30分)

03-树2 List Leaves (25分)

02-线性结构4 Pop Sequence (25分)

02-线性结构1 两个有序链表序列的合并 (15分)

UVA 11809

UVa Box 1587

UVa10340 All in All

最大连续子序列和（小结）

蓝桥杯历届试题---蚂蚁感冒

1005. Spell It Right (20)

1006. Sign In and Sign Out (25)

1008. Elevator (20)

【蓝桥杯】算法提高夺宝奇兵

树状数组------冒泡排序的交换次数

1011. World Cup Betting (20)