PAT
文章平均质量分 71
刷题:LeetCode与PAT
linghugoogle1
Show me the code.
展开
-
【笨方法学PAT】1051 Pop Sequence (25 分)
一、题目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 sequenc...原创 2018-12-20 10:48:35 · 191 阅读 · 0 评论 -
【笨方法学PAT】1044 Shopping in Mars (25 分)
一、题目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 pos...原创 2018-12-20 10:48:44 · 136 阅读 · 0 评论 -
【未完成】【笨方法学PAT】1060 Are They Equal (25 分)
一、题目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×105 with simple chopping. Now given the number of ...原创 2018-12-20 10:48:55 · 163 阅读 · 0 评论 -
【笨方法学PAT】1059 Prime Factors (25 分)
一、题目Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1k1×p2k2×⋯×pmkm.Input Specification:Each input f...原创 2018-12-20 10:49:01 · 118 阅读 · 0 评论 -
【笨方法学PAT】1038 Recover the Smallest Number (30 分)
一、题目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-321...原创 2018-12-20 10:49:07 · 98 阅读 · 0 评论 -
【笨方法学PAT】1040 Longest Symmetric String (25 分)
一、题目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, henc...原创 2018-12-20 10:49:51 · 117 阅读 · 0 评论 -
【未完成】【笨方法学PAT】1091 Acute Stroke (30 分)
一、题目One important factor to identify acute stroke (急性脑卒中) is the volume of the stroke core. Given the results of image analysis in which the core regions are identified in each MRI slice, your job i...原创 2018-12-20 10:49:56 · 175 阅读 · 0 评论 -
【笨方法学PAT】1103 Integer Factorization (30 分)
一、题目The K−P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K−P factorization of N for any po...原创 2018-12-20 10:50:22 · 146 阅读 · 0 评论 -
【未完成】【笨方法学PAT】1111 Online Map (30 分)
一、题目Input our current position and a destination, an online map can recommend several paths. Now your job is to recommend two paths to your user: one is the shortest, and the other is the fastest. I...原创 2018-12-20 10:50:00 · 164 阅读 · 1 评论 -
【笨方法学PAT】1087 All Roads Lead to Rome (30 分)
一、题目Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.Input Specification:...原创 2018-12-20 10:50:04 · 128 阅读 · 0 评论 -
【笨方法学PAT】1066 Root of AVL Tree (25 分)
一、题目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, rebalanc...原创 2018-12-20 10:51:00 · 187 阅读 · 0 评论 -
【笨方法学PAT】1080 Graduate Admission (30 分)
一、题目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 adm...原创 2018-12-20 10:51:05 · 119 阅读 · 0 评论 -
【笨方法学PAT】1076 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. W...原创 2018-12-20 10:51:10 · 449 阅读 · 0 评论 -
【未完成】【笨方法学PAT】1072 Gas Station (30 分)
一、题目A gas station has to be built at such a location that the minimum distance between the station and any of the residential housing is as far away as possible. However it must guarantee that all t...原创 2018-12-20 10:51:15 · 160 阅读 · 0 评论 -
【笨方法学PAT】1034 Head of a Gang (30 分)
一、题目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 t...原创 2018-12-23 22:32:33 · 217 阅读 · 0 评论 -
【笨方法学PAT】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 in...原创 2018-12-23 22:32:39 · 124 阅读 · 0 评论 -
【笨方法学PAT】1053 Path of Equal Weight (30 分)
一、题目Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum of the weights of all the nodes along the pa...原创 2018-12-23 22:32:45 · 97 阅读 · 0 评论 -
【笨方法学PAT】1030 Travel Plan (30 分)
一、题目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 ...原创 2018-12-23 22:32:50 · 123 阅读 · 0 评论 -
【笨方法学PAT】1117 Eddington Number (25 分)
一、题目British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an "Eddington number", E -- that is, the maximum integer E such that it is ...原创 2018-12-23 22:32:55 · 96 阅读 · 0 评论 -
【笨方法学PAT】1078 Hashing (25 分)
一、题目The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of the input numbers. The hash function is defined to be H(key)=ke...原创 2018-12-23 22:33:14 · 120 阅读 · 0 评论 -
【笨方法学PAT】1070 Mooncake (25 分)
一、题目Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional mooncakes according to the region's culture...原创 2018-12-23 22:33:19 · 151 阅读 · 0 评论 -
【笨方法学PAT】1122 Hamiltonian Cycle (25 分)
一、题目The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a "Hamiltonian cycle".In this problem, you are supposed to tell if a given ...原创 2018-12-23 22:33:42 · 97 阅读 · 0 评论 -
【笨方法学PAT】1121 Damn Single (25 分)
一、题目"Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can be taken care of.Input Specification:Eac...原创 2018-12-23 22:33:31 · 139 阅读 · 0 评论 -
【笨方法学PAT】1036 Boys vs Girls (25 分)
一、题目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...原创 2018-12-23 22:33:25 · 120 阅读 · 0 评论 -
【笨方法学PAT】1113 Integer Set Partition (25 分)
一、题目Given a set of N (>1) positive integers, you are supposed to partition them into two disjoint sets A1 and A2 of n1 and n2numbers, respectively. Let S1 and S2 denote the sums...原创 2018-12-23 22:34:01 · 165 阅读 · 0 评论 -
【笨方法学PAT】1112 Stucked Keyboard (20 分)
一、题目On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will appear repeatedly on screen for k times.Now given a ...原创 2018-12-24 10:19:42 · 125 阅读 · 0 评论 -
【笨方法学PAT】1074 Reversing Linked List (25 分)
一、题目Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; i...原创 2018-12-24 10:19:55 · 257 阅读 · 0 评论 -
【笨方法学PAT】1097 Deduplication on a Linked List (25 分)
一、题目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 valu...原创 2018-12-24 10:20:02 · 106 阅读 · 0 评论 -
【笨方法学PAT】1133 Splitting A Linked List (25 分)
一、题目Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all thos...原创 2018-12-24 10:20:09 · 145 阅读 · 0 评论 -
【笨方法学PAT】1052 Linked List Sorting (25 分)
一、题目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. No...原创 2018-12-24 10:20:14 · 104 阅读 · 0 评论 -
【笨方法学PAT】1032 Sharing (25 分)
一、题目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 ex...原创 2018-12-24 10:20:20 · 143 阅读 · 0 评论 -
【笨方法学PAT】1134 Vertex Cover (25 分)
一、题目A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. Now given a graph with several vertex sets, you are supposed to tel...原创 2018-12-24 10:20:25 · 145 阅读 · 0 评论 -
【笨方法学PAT】1108 Finding Average (20 分)
一、题目The basic task is simple: given N real numbers, you are supposed to calculate their average. But what makes it complicated is that some of the input numbers might not be legal. A legal input is ...原创 2018-12-24 10:19:49 · 220 阅读 · 0 评论 -
【笨方法学PAT】1127 ZigZagging on a Tree (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. And it is a simple...原创 2018-12-24 10:20:30 · 199 阅读 · 0 评论 -
【笨方法学PAT】1126 Eulerian Path (25 分)
一、题目In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They wer...原创 2018-12-24 10:20:35 · 129 阅读 · 0 评论 -
【笨方法学PAT】1125 Chain the Ropes (25 分)
一、题目Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one piece, as shown by the figure. The resultin...原创 2018-12-24 10:20:41 · 99 阅读 · 0 评论 -
【笨方法学PAT】1140 Look-and-say Sequence (20 分)
一、题目Look-and-say sequence is a sequence of integers as the following:D, D1, D111, D113, D11231, D112213111, ...where D is in [0, 9] except 1. The (n+1)st number is a kind of description of the...原创 2018-12-24 10:20:50 · 132 阅读 · 0 评论 -
【笨方法学PAT】1138 Postorder Traversal (25 分)
一、题目Suppose that all the keys in a binary tree are distinct positive integers. Given the preorder and inorder traversal sequences, you are supposed to output the first number of the postorder traver...原创 2018-12-24 10:21:03 · 185 阅读 · 0 评论 -
【笨方法学PAT】1146 Topological Order (25 分)
一、题目This is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a topological order obtained from the given directed graph? Now you are supposed to write a program t...原创 2019-01-01 23:27:11 · 141 阅读 · 0 评论 -
【笨方法学PAT】1145 Hashing - Average Search Time (25 分)
一、题目The task of this problem is simple: insert a sequence of distinct positive integers into a hash table first. Then try to find another sequence of integer keys from the table and output the avera...原创 2019-01-01 23:27:16 · 137 阅读 · 0 评论