PTA习题
文章平均质量分 83
明朗晨光
You will never be ready!
展开
-
01-复杂度1 最大子列和问题
题目给定K个整数组成的序列{N1,N2, ...,NK},“连续子列”被定义为{Ni,Ni+1, ...,Nj},其中1≤i≤j≤K。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定序列{ -2, 11, -4, 13, -5, -2 },其连续子列{ 11, -4, 13 }有最大的和20。现要求你编写程序,计算给定整数序列...原创 2019-07-18 19:26:46 · 257 阅读 · 0 评论 -
01-复杂度2 Maximum Subsequence Sum
题目Given a sequence ofKintegers {N1,N2, ...,NK}. A continuous subsequence is defined to be {Ni,Ni+1, ...,Nj} where1≤i≤j≤K. The Maximum Subsequence is the continuous subse...原创 2019-07-18 19:32:00 · 111 阅读 · 0 评论 -
01-复杂度3 二分查找
题目本题要求实现二分查找算法。函数接口定义:Position BinarySearch( List L, ElementType X );其中List结构定义如下:typedef int Position;typedef struct LNode *List;struct LNode { ElementType Data[MAXSIZE]; Posit...原创 2019-07-18 19:33:27 · 284 阅读 · 0 评论 -
02-线性结构1 两个有序链表序列的合并
题目本题要求实现一个函数,将两个链表表示的递增整数序列合并为一个非递减的整数序列。函数接口定义:List Merge( List L1, List L2 );其中List结构定义如下:typedef struct Node *PtrToNode;struct Node { ElementType Data; /* 存储结点数据 */ PtrToNode ...原创 2019-07-18 20:32:09 · 215 阅读 · 0 评论 -
02-线性结构2 一元多项式的乘法与加法运算
题目设计函数分别求两个一元多项式的乘积与和。输入格式:输入分2行,每行分别先给出多项式非零项的个数,再以指数递降方式输入一个多项式非零项系数和指数(绝对值均为不超过1000的整数)。数字间以空格分隔。输出格式:输出分2行,分别以指数递降方式输出乘积多项式以及和多项式非零项的系数和指数。数字间以空格分隔,但结尾不能有多余空格。零多项式应输出0 0。输入样例:4 3 4 ...原创 2019-07-25 18:54:26 · 2313 阅读 · 4 评论 -
02-线性结构3 Reversing Linked List
题目Given a constantKand a singly linked listL, you are supposed to reverse the links of everyKelements onL. For example, givenLbeing 1→2→3→4→5→6, ifK=3, then you must output 3→2→1→6→5→4; if...原创 2019-08-01 15:42:07 · 304 阅读 · 0 评论 -
02-线性结构4 Pop Sequence
题目Given a stack which can keepMnumbers at most. PushNnumbers in the order of 1, 2, 3, ...,Nand pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence ...原创 2019-08-01 15:45:55 · 199 阅读 · 0 评论 -
03-树1 树的同构
题目给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2,则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的,因为我们把其中一棵树的结点A、B、G的左右孩子互换后,就得到另外一棵树。而图2就不是同构的。图1图2现给定两棵树,请你判断它们是否是同构的。输入格式:输入给出2棵二叉树的信息。对于每棵树,首先在一行中给出一个非负整数N(≤10),即该...原创 2019-08-01 16:01:25 · 779 阅读 · 0 评论 -
03-树2 List Leaves
题目Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input Specification:Each input file contains one test case. For each case, the first line give...原创 2019-08-01 16:08:05 · 216 阅读 · 0 评论 -
03-树3 Tree Traversals Again
题目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, t...原创 2019-08-07 16:55:48 · 237 阅读 · 0 评论 -
04-树4 是否同一棵二叉搜索树
题目给定一个插入序列就可以唯一确定一棵二叉搜索树。然而,一棵给定的二叉搜索树却可以由多种不同的插入序列得到。例如分别按照序列{2, 1, 3}和{2, 3, 1}插入初始为空的二叉搜索树,都得到一样的结果。于是对于输入的各种插入序列,你需要判断它们是否能生成一样的二叉搜索树。输入格式:输入包含若干组测试数据。每组数据的第1行给出两个正整数N(≤10)和L,分别是每个序列插入元素的个数...原创 2019-08-15 15:56:13 · 1222 阅读 · 0 评论 -
04-树5 Root of AVL Tree
题目An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancin...原创 2019-08-17 17:15:03 · 199 阅读 · 0 评论 -
04-树6 Complete Binary Search Tree
题目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 righ...原创 2019-08-20 16:39:29 · 484 阅读 · 0 评论 -
05-树7 堆中的路径
题目将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i,打印从H[i]到根结点的路径。输入格式:每组测试第1行包含2个正整数N和M(≤1000),分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的N个要被插入一个初始为空的小顶堆的整数。最后一行给出M个下标。输出格式:对输入中给出的每个下标i,在一行中输出从H[i]...原创 2019-08-22 17:21:11 · 391 阅读 · 0 评论 -
05-树8 File Transfer
题目We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any compu...原创 2019-08-24 20:38:10 · 337 阅读 · 0 评论 -
05-树9 Huffman Codes
题目In 1953, David A. Huffman published his paper "A Method for the Construction of Minimum-Redundancy Codes", and hence printed his name in the history of computer science. As a professor who gives t...原创 2019-09-03 19:10:17 · 522 阅读 · 0 评论