kyln1039的博客

maven学习笔记

kyln1039 — Wed, 28 Apr 2021 18:23:52 +0800

maven学习笔记maven基础依赖管理仓库仓库种类仓库关系一键构成常用命令生命周期maven导入jar包maven学习遇到的问题1.resources出现warning2.运行tomcat:run报错 maven基础 maven是一个项目管理工具依赖管理依赖管理就是maven对项目中jar包的管理过程。传统工程我们直接把jar包放置在项目中，而maven工程真正的jar包放置在仓库中，项目...

PAT专题训练——数字题

kyln1039 — Wed, 28 Apr 2021 18:22:50 +0800

PAT专题训练——数字题一.A+B系列1001100210581065二.数的表达系列1005三.进制相关1010101510191027四.逐位处理102310241060翻转数1069 一.A+B系列 1001 该题的重点是：A和B是数字，将A+B的结果用标准形式表现出 Sample Input: -1000000 9 Sample Output: -999,991 解决方法：将结果的每位数从后往前保存在数组中，再从前往后输出，每三位再输出一个, 题目通道PAT A101 1002 该题的A和B是多项式

PAT专题训练——数列

kyln1039 — Wed, 28 Apr 2021 18:22:34 +0800

PAT专题训练——数列A1007 求和最大子序列A1029 求两个有序序列的中位数 A1007 求和最大子序列 A1029 求两个有序序列的中位数

杭电oj2000-2099难点记录

kyln1039 — Sun, 28 Mar 2021 01:15:14 +0800

T2030 汉字识别汉字内码由两个字节组成，且最高位为1 因此可以识别连续的两个字节且为负，即为一个汉字 #include using namespace std; #include int main() { int n; cin >> n; string str; getline(cin, str); while (n--) { getline(cin, str); int num = 0; int f

汉诺塔问题

kyln1039 — Sun, 14 Feb 2021 23:30:36 +0800

汉诺塔问题简单汉诺塔变形一简单汉诺塔在一块铜板上有三根杆，最左边的杆上自上而下、由小到大顺序串着由n个圆盘构成的塔。目的是将最左边杆上的盘全部移到右边的杆上，条件是一次只能移动一个盘，且不允许大盘放在小盘的上面。 1个盘子：将盘子从最左边移动到最右边，只需1步，即a[1]=1 2个盘子：将小盘子从最左边移动到中间，再将大盘子从最左边移动到最右边，最后将小盘子从中间移动到最右边，如下图1~3所示，共需3步，即a[2]=3 3个盘子就可以寻找到规律了，如图所示，共需7步，即a[3]=7 综上所述，在三

PAT A1007 Maximum Subsequence Sum (25分)

kyln1039 — Thu, 03 Sep 2020 21:19:15 +0800

1007 Maximum Subsequence Sum 25分原题大体题意思路代码运行结果原题 Given a sequence of K integers { N1 , N2 , …, NK }. A continuous subsequence is defined to be { Ni , Ni+1 , …, Nj } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence whi

PAT专题训练——图

kyln1039 — Thu, 03 Sep 2020 19:34:27 +0800

PAT专题训练——图图有关的题图的建立1.邻接矩阵题型1.最短路径Dijkstra2.最小路径Dijkstra+结点权重图有关的题 1003、1013、1018、1021、1030、1046、1072、1076、1087、1111、1122、1124、1126、1131、1134、1139、1142、1146、1150、1154 图的建立 1.邻接矩阵 typedef struct { int Vex[MaxVertexNum];//结点信息 int Edge[MaxVertexNum][MaxVer

PAT A1018 Public Bike Management (30分)

kyln1039 — Thu, 03 Sep 2020 16:33:09 +0800

1018 Public Bike Management 30分原题大体题意思路代码运行结果原题 There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city. T

PAT A1150 Travelling Salesman Problem (25分)

kyln1039 — Wed, 02 Sep 2020 17:10:32 +0800

1150 Travelling Salesman Problem 25分原题大体题意思路代码：运行结果原题 The “travelling salesman problem” asks the following question: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and retur

PAT A1076 Forwards on Weibo (30分)

kyln1039 — Wed, 02 Sep 2020 14:37:07 +0800

PAT A1076 Forwards on Weibo 30分原题大体题意思路代码运行结果原题 Weibo is known as the Chinese version of Twitter. One user on Weibo may have many followers, and may follow many other users as well. Hence a social network is formed with followers relations. When a user ma

PAT A1021 Deepest Root (25分)

kyln1039 — Tue, 01 Sep 2020 20:30:33 +0800

PAT A1021 Deepest Root 25分原题大体题意思路代码运行结果原题 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 supposed to find the root that results in a highest tree. Such a root is called th

PAT A1046 Shortest Distance (20分)

kyln1039 — Tue, 01 Sep 2020 18:16:57 +0800

1046 Shortest Distance 20分原题大体题意代码运行结果原题 The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits. Input Specification: Each input file contains one test cas

PAT A1013 Battle Over Cities (25分)

kyln1039 — Tue, 01 Sep 2020 17:43:17 +0800

PAT A1013 Battle Over Cities 25分原题大体题意思路代码运行结果原题 It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to r

PAT A1119 Pre- and Post-order Traversals (30分)

kyln1039 — Tue, 01 Sep 2020 14:44:27 +0800

1119 Pre- and Post-order Traversals 30分原题大体题意思路代码运行结果原题 Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences, or preorder and inorder

PAT A1110 Complete Binary Tree (25分)

kyln1039 — Tue, 01 Sep 2020 11:33:43 +0800

1110 Complete Binary Tree 25分原题大体题意思路代码运行结果原题 Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each input file contains one test case. For each case, the first line gives a positive integer N (≤20) which is the

PAT A1102 Invert a Binary Tree (25分)

kyln1039 — Tue, 01 Sep 2020 10:47:54 +0800

1102 Invert a Binary Tree 25分原题大体题意思路代码运行结果原题 The following is from Max Howell @twitter: Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off. Now it’s your turn to prove that Y

PAT A1099 Build A Binary Search Tree (30分)

kyln1039 — Tue, 01 Sep 2020 10:38:19 +0800

PAT A1099 Build A Binary Search Tree 30分原题大体题意思路代码运行结果原题 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with keys less than the node’s key. The right su

PAT A1094 The Largest Generation (25分)

kyln1039 — Tue, 01 Sep 2020 10:25:57 +0800

PAT A1094 The Largest Generation 25分原题大体题意思路代码运行结果原题 A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation with the largest population. Input Spe

PAT A1090 Highest Price in Supply Chain (25分)

kyln1039 — Mon, 31 Aug 2020 20:20:29 +0800

@[TOC](PAT A1090 Highest Price in Supply Chain (25分)) 原题 A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involved in moving a product from supplier to customer. Starting from one root supplier, everyone on th

PAT A1086 Tree Traversals Again (25分)

kyln1039 — Mon, 31 Aug 2020 20:02:05 +0800

PAT A1086 Tree Traversals Again 25分原题大体题意思路代码运行结果原题 An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack o