为了远大的理想，冲锋！

检查单词是否为句中其他单词的前缀

List：ArrayList和LinkedListQueue：LinkedListStack：LinkedListMap：HashMapSet：HashSet

One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call betweenAandB, we say thatAandBis related. The weight of a relation is defined to be t...

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; ifK=4, ...

堆：大顶堆：根结点比左右子树更大；小顶堆：根节点比左右子树更小。定义一个堆： const int main=100;//heap为堆，n为元素个数int heap[maxn],n=10; 调整堆： //在heap数组在[low,high]范围进行向下调整//其中low为欲调整的结点的数组下标，high一般为堆的最后一个元素的数组下标void downAdj...

Zhejiang University has 40000 students and provides 2500 courses. Now given the student name lists of all the courses, you are supposed to output the registered course list for each student who com...

People on Mars count their numbers with base 13:Zero on Earth is called "tret" on Mars. The numbers 1 to 12 on Earth is called "jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec" on Mars, ...

Input Specification:Each input file contains one test case. For each case, the first line contains two integersN(≤10​5​​) andC, whereNis the number of records andCis the column that you are s...

分数的四则运算是从小学开始接触，运算规则和原理大家应该都很清楚了。我们现在要做的就是如何通过程序，让计算机来做分数的四则运算。1 分数的表示首先来表示一个分数，最简单的就是用假分数表示了，也就是无论分子比分母大还是比分母小，都保留原数。那么就可以通过设置一个结构体来存储这种只有分子和分母的分数了。struct Fraction{ int up,down;};2 分数的化...

Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called th...

Zhejiang University has 40,000 students and provides 2,500 courses. Now given the registered course list of each student, you are supposed to output the student name lists of all the courses.Input S...

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, rebalancing...

Given a list ofNstudent records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades ...

Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world's wealthiest people. Now you are supposed to simulate this job, but concentrate only on the peopl...

Given a singly linked listLwith integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each valueK, only the first node of which the value or a...

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...

关于树这一块，前期没有做一个学习的绪论，因为时间来不及了。在总结上回顾一下这些题目的一些特点 树的遍历的是数据结构树这一块中的一部分。 树的遍历和二叉树的遍历本质上相同。二叉树用指针也可以做，但是在考试中用静态数组处理树更有优势 树的遍历一般的模板是：输入——递归（设置边界-递归两步）——输出 输入形式的代码： for(int i=0;i<prese...

Mice and Riceis the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given map. The goal of each mouse is to eat as much rice...

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts...

People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker...

It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if you could write a program to automate the admission...

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...

一、栈的应用栈是一种先进后出(FILO)的数据结构 清空(clear)： /*栈的清空操作就是把栈顶top置为-1*/void clear(){ top=-1;}/*清空栈，由于没有直接用于清空栈的元素，所以使用while和pop组合*/while(!st.size()) st.pop(); 获取栈内元素个数(size)： /*由于栈顶指针t...

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...

并查集的定义：“并”，Union(合并)；“查”，Find(查找)；“集”，Set(查找)；并查集的实现： int father[N]; //使用一个数组记录father[1]=1; //1的父节点是本身father[2]=1; //2的父节点是1 并查集的初始化： for(int i=1;i<=n;i++){ father[i]=i;} ...

在PTA提交Java程序需要注意如下几个要点：文章目录0. 不要包含package关键字1. Main类与Scanner1.1 Main类1.2 使用Scanner处理输入2.Scanner对象常用方法3.字符串与整型互相转换4.Scanner常见问题5.输出5.1 `System.out.println("abc")`打印字符串"abc"并回车换行。可使用`+`号连接各个类型的变量，组装成字符...

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 of t...

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 ...

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 stac...

题目描述本题要求实现一种数字加密方法。首先固定一个加密用正整数 A，对任一正整数 B，将其每 1 位数字与 A 的对应位置上的数字进行以下运算：对奇数位，对应位的数字相加后对 13 取余——这里用 J 代表 10、Q 代表 11、K 代表 12；对偶数位，用 B 的数字减去 A 的数字，若结果为负数，则再加 10。这里令个位为第 1 位。输入格式：输入在一行中依次给出 A 和 B...

1.vector的常见用法vector翻译为向量，但是用“长短根据需要而自动改变的数组”更容易记忆。如果要使用vector，则需要用到头文件#include &lt;vector&gt;，另外还需要using namespace std; 才可以使用。PAT中的相关题目有（代码见下方）：1039 Course List for Student （25 分）1047 Student ...

If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as0.123×10​5​​with simple chopping. Now given the number of signif...

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...

When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. Asocial clusteris a set of people who have some of t...

散列的介绍散列（hash）是常用的算法思想之一，在很多程序上都会有意无意的使用到。用一句话来概括散列思想的话就是：“将元素通过一个函数转换为整数，使得该整数可以尽量唯一地代表这个元素”。其中把转换函数称为散列函数H。那么对key是整数来说，有哪些常用的散列函数呢？一般来说，常见的散列函数有直接定址法、平方取中法、除留余数法，其中直接定址法是指恒等变换（即H(key)=key，很多问题都是直...

目录五、queue的常见用法六、priority_queue的常见用法七、stack的常见用法八、algorithm头文件下的常用函数五、queue的常见用法queue也就是队列，是STL中实现先进先出的容器。queue是在当需要实现BFS的时候，可以不用自己去手动实现一个队列，而是用queue作为代替，提高代码的准确性。另外要注意的一点是，在使用front()和back(...

According to Wikipedia:Insertion sortiterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data,...

Given a non-empty tree with rootR, and with weightW​i​​assigned to each tree nodeT​i​​. Theweight of a path fromRtoLis defined to be the sum of the weights of all the nodes along the path fro...

Given two sets of integers, the similarity of the sets is defined to beN​c​​/N​t​​×100%, whereN​c​​is the number of distinct common numbers shared by the two sets, andN​t​​is the total number of ...

1 素数1.1 素数的判断素数的判断较为简单，直接上代码，需要注意的几点：bool isPrime(int n){ if(n==1) return false; //1需要特判 int sqr=(int)sqrt(n*1.0); //之所以要用这条语句而不是在for循环里使用sqrt(n)，解释如下 for(int i=2;i&lt;=sqr...