weixin_43899069的博客

以下每道题均是笔者多方对比后， 思考整理得到的最优代码，欢迎交流！ PAT题解目录标题题解分类备注1001 A+B Format (20分)9行代码AC*字符串处理

立志用更少的代码做更高效的表达Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence { 0.1, 0.2, 0.3, 0.4 }, we have 10 segments: (0.1) (0.1, 0.2) (0.1, 0.2, 0.3) (0.1, 0.2, 0.3, 0.4) (0.2) (0.2, 0.3

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K, only the first node of which the value or absolute value of i

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3×5×6×7, where 5, 6, and 7 are the three consecutive numbers. Now given any positive N, yo

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.Now given a string that you are supposed to type, and the str

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given N rational numbers in the form numerator/denominator, you are supposed to calculate their sum.Input Specification:Each input file contains one test case. Each case starts with a positive integer N (≤100), fol

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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’s identity, which

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given any permutation of the numbers {0, 1, 2,…, N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given three integers A, B and C in [−2^​63​​ ,2^​63​​ ], you are supposed to tell whether A+B>C.Input Specification:The first line of the input gives the positive number of test cases, T (≤10). Then T test cases

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given two sets of integers, the similarity of the sets is defined to be N​c​​/N​t​​×100%, where N​c​​ is the number of distinct common numbers shared by the two sets, and N​t​​ is the total number of distinct numbers i

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Sherlock Holmes received a note with some strange strings: Let’s date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm. It took him only a minute to figure out that those strange strings are actually refe

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0.123×10​5​​ with simple chopping. Now given the number of significant digits on a

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p​1​​​k​1​​​​×p​2​​​k​2​​​​×⋯×p​m​​​k​m​​​​.Input Specification:Each input file contains one test ca

PAT甲级最优题解——>传送门If you are a fan of Harry Potter, you would know the world of magic has its own currency system – as Hagrid explained it to Harry, “Seventeen silver Sickles to a Galleon and twenty-nine Knuts to a Sickle, it’s easy enough.” Your job is

立志用最少的代码做最高效的表达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 people in a certain range of ages. That is,

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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 the dominant color. A s

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门A linked list consists of a series of structures, which are not necessarily adjacent in memory. We assume that each structure contains an integer key and a Next pointer to the next structure. Now given a linked list, y

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For exampl

立志用最少的代码做最高效的表达Given two strings S​1​​ and S​2​​, S=S​1​​−S​2​​ is defined to be the remaining string after taking all the characters in S​2​​ from S​1​​. Your task is simply to calculate S​1​​−S​2​​ for any given strings. However, it might not be that

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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 coins as payments. However, there was a speci

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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 Specification:Eac

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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 chain can be cut at any position for only once and

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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 case.

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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 subtree of a node con

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid “inside jobs” where employees collaborate with gamblers by performing in

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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 recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-

立志用最少的代码做最高效的表达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 comes for a query.Input Specification:Ea

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given Is PAT&TAP symmetric?, the longest symmetric sub-string is s PAT&TAP s, hence you must output 11.

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1,10^​4]. The first one who bets on a unique number w

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students.Input Specification:Each input file contains one test case. Each cas

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门One way that the police finds the head of a gang is to check people’s phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a relation is defined to be the total time leng

立志用最少的代码做最高效的表达To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o i

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Different gas station may give

立志用最少的代码做最高效的表达To store English words, one method is to use linked lists and store a word letter by letter. To save some space, we may let the words share the same sublist if they share the same suffix. For example, loading and being are stored as showe

立志用最少的代码做最高效的表达Given any string of N (≥5) characters, you are asked to form the characters into the shape of U. For example, helloworld can be printed as:h de ll rlowoThat is, the characters must be printed in the original order, starting top-

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门A traveler’s map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to decide the shortest path between his/her sta

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门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

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门Excel can sort records according to any column. Now you are supposed to imitate this function.Input Specification:Each input file contains one test case. For each case, the first line contains two integers N (≤10^5

立志用最少的代码做最高效的表达People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number, where the first 2 digits are for Red, the middle 2 digits for Green, and the last 2 digits f

立志用最少的代码做最高效的表达PAT甲级最优题解——>传送门A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All single digit numbers are palindromic numbers.Non-palindromic