柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. 1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1049. COUNTING ONES (30)-PAT甲级真题（数学问 …TRANSLATE THIS

PAGE

1049. Counting Ones (30)-PAT甲级真题（数学问题）. The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1’s in 1, 10, 11, and 12. Each input file contains one test case which gives the 1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 1049. 数列的片段和(20)-PAT乙级真题 给定一个正数数列，我们可以从中截取任意的连续的几个数，称为片段。例如，给定数列{0.1, 0.2, 0.3, 0.4}，我们有(0.1) (0.1, 0.2 小米有品·米物蓝牙双模键盘说明书 小米有品·米物蓝牙双模键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 文章导航. 上一 1067. 试密码(20)-PAT乙级真题 1067. 试密码 (20)-PAT乙级真题. 当你试图登录某个系统却忘了密码时，系统一般只会允许你尝试有限多次，当超出允许次数时，账号就会被锁死。. 本题就请你实现这个小功能。. 输入在第一行给出一个密码（长度不超过20的、不包含空格、Tab、回车的非空字符串

柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. 1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1049. COUNTING ONES (30)-PAT甲级真题（数学问 …TRANSLATE THIS

PAGE

1049. Counting Ones (30)-PAT甲级真题（数学问题）. The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1’s in 1, 10, 11, and 12. Each input file contains one test case which gives the 1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 1049. 数列的片段和(20)-PAT乙级真题 给定一个正数数列，我们可以从中截取任意的连续的几个数，称为片段。例如，给定数列{0.1, 0.2, 0.3, 0.4}，我们有(0.1) (0.1, 0.2 小米有品·米物蓝牙双模键盘说明书 小米有品·米物蓝牙双模键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 文章导航. 上一 1067. 试密码(20)-PAT乙级真题 1067. 试密码 (20)-PAT乙级真题. 当你试图登录某个系统却忘了密码时，系统一般只会允许你尝试有限多次，当超出允许次数时，账号就会被锁死。. 本题就请你实现这个小功能。. 输入在第一行给出一个密码（长度不超过20的、不包含空格、Tab、回车的非空字符串 1043. IS IT A BINARY SEARCH TREE (25)-PAT甲级真题 1043. Is It a Binary Search Tree (25)-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 contains only nodes with keys greater than or equal to the node’s

key.

1049. COUNTING ONES (30)-PAT甲级真题（数学问 …TRANSLATE THIS

PAGE

1049. Counting Ones (30)-PAT甲级真题（数学问题）. The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1’s in 1, 10, 11, and 12. Each input file contains one test case which gives the 1032. SHARING (25)-PAT甲级真题 Sharing (25)-PAT甲级真题 – 柳婼 の blog. 1032. Sharing (25)-PAT甲级真题. 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

1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

已知后序与中序输出前序（先序） 已知后序与中序输出前序（先序）： 后序：3, 4, 2, 6, 5, 1（左右根） 中序：3, 2, 4, 1, 6, 5（左根右） 分析：因为后序的最后一个总是根结点，令i在中序中找到该根结点，则i把中序分为两部分，左边是左子树，右 洛菲键盘说明书 洛菲键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 1049. 数列的片段和(20)-PAT乙级真题 给定一个正数数列，我们可以从中截取任意的连续的几个数，称为片段。例如，给定数列{0.1, 0.2, 0.3, 0.4}，我们有(0.1) (0.1, 0.2 1073. 多选题常见计分法(20)-PAT乙级真题 1073. 多选题常见计分法 (20)-PAT乙级真题. 批改多选题是比较麻烦的事情，有很多不同的计分方法。. 有一种最常见的计分方法是：如果考生选择了部分正确选项，并且没有选择任何错误选项，则得到50%分数；如果考生选择了任何一个错误的选项，则不能得分 1067. 试密码(20)-PAT乙级真题 1067. 试密码 (20)-PAT乙级真题. 当你试图登录某个系统却忘了密码时，系统一般只会允许你尝试有限多次，当超出允许次数时，账号就会被锁死。. 本题就请你实现这个小功能。. 输入在第一行给出一个密码（长度不超过20的、不包含空格、Tab、回车的非空字符串 为什么要对1000000007取模（取余） 为什么要对1000000007取模（取余）. 大数阶乘，大数的排列组合等，一般都要求将输出结果对1000000007取模（取余）. 为什么总是1000000007呢= =. 大概≖‿≖ 是因为：（我猜的，不服你打我呀~）. 1. 1000000007是一个质数（素数），对质数取余能最大程度避免冲突～.

2

柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. ABOUT ME – 日常 (๑• . •๑) – 柳婼 の BLOGTRANSLATE

THIS PAGE

About Me – 日常 (๑• . •๑) 本萌喵是一枚计算机系软件工程专业的学生～～（虽然浙大计算机群和PAT算法讨论群里很多人叫我“柳神”哈哈哈）也许和很多经验丰富的大神们相比我很渺小，但我相信只要努力终会创造价值的~本博客从大一创建至今，旨在记录下 1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1041. BE UNIQUE (20)-PAT甲级真题（HASH散列） 1041. Be Unique (20)-PAT甲级真题（Hash散列）. 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 . The first one who bets on a unique number wins. 1095. CARS ON CAMPUS (30)-PAT甲级真题（MAP， …TRANSLATE THIS

PAGE

1095. Cars on Campus (30)-PAT甲级真题（map，排序）. Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus 1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 洛菲键盘说明书 洛菲键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版.

柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. ABOUT ME – 日常 (๑• . •๑) – 柳婼 の BLOGTRANSLATE

THIS PAGE

About Me – 日常 (๑• . •๑) 本萌喵是一枚计算机系软件工程专业的学生～～（虽然浙大计算机群和PAT算法讨论群里很多人叫我“柳神”哈哈哈）也许和很多经验丰富的大神们相比我很渺小，但我相信只要努力终会创造价值的~本博客从大一创建至今，旨在记录下 1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1041. BE UNIQUE (20)-PAT甲级真题（HASH散列） 1041. Be Unique (20)-PAT甲级真题（Hash散列）. 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 . The first one who bets on a unique number wins. 1095. CARS ON CAMPUS (30)-PAT甲级真题（MAP， …TRANSLATE THIS

PAGE

1095. Cars on Campus (30)-PAT甲级真题（map，排序）. Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus 1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 洛菲键盘说明书 洛菲键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1054. THE DOMINANT COLOR (20)-PAT甲级真题 1054. The Dominant Color (20)-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 strictly dominant color takes more than half of 1080. GRADUATE ADMISSION (30)-PAT甲级真题 Graduate Admission (30)-PAT甲级真题 – 柳婼 の blog. 1080. Graduate Admission (30)-PAT甲级真题. It is said that in 2013, there were 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 procedure. Each applicant

will have

洛菲键盘说明书 洛菲键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. ★书籍推荐列表

1. Java

Web技术（我按零基础入门到提高的顺序推荐，同一子标题的选其一即可，Java Web开发应该是我大学期间花费时间精力最多的一门技术了，比一开始学的iOS开发花的时间还要长，期间踩了很多坑，写了很多项目，也看了很多好书烂书，以下推荐的都是我看过 1007. 素数对猜想 (20)-PAT乙级真题 1007. 素数对猜想 (20)-PAT乙级真题. 让我们定义 dn 为：dn = pn+1 – pn，其中 pi 是第i个素数。. 显然有 d1=1 且对于n>1有 dn 是偶数。. “素数对猜想”认为“存在无穷多对相邻且差为2的素数”。. 现给定任意正整数N (< 105)，请计算不超过N的满足猜想的素数对的个数 1052. 卖个萌 (20)-PAT乙级真题 1052. 卖个萌 (20)-PAT乙级真题. 萌萌哒表情符号通常由“手”、“眼”、“口”三个主要部分组成。. 简单起见，我们假设一个表情符号是按下列格式输出的：. 现给出可选用的符号集合，请你按用户的要求输出表情。. 输入首先在前三行顺序对应给出手、眼、口的 小米有品·米物蓝牙双模键盘说明书 小米有品·米物蓝牙双模键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 文章导航. 上一 1073. 多选题常见计分法(20)-PAT乙级真题 1073. 多选题常见计分法 (20)-PAT乙级真题. 批改多选题是比较麻烦的事情，有很多不同的计分方法。. 有一种最常见的计分方法是：如果考生选择了部分正确选项，并且没有选择任何错误选项，则得到50%分数；如果考生选择了任何一个错误的选项，则不能得分

BLOG离线版

为了下一年交年费的时候不再这么窘迫. 所以花费了很多心思整理，还包括后期的离线版本永久免费更新希望能以此获得一些blog年费资助～. 订阅方式：打赏固定金额并备注你的常用邮箱（后期的所有大版本更新都会发送到你备注的邮箱中），订阅后24小时内

柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 ABOUT ME – 日常 (๑• . •๑) – 柳婼 の BLOGTRANSLATE

THIS PAGE

About Me – 日常 (๑• . •๑) 本萌喵是一枚计算机系软件工程专业的学生～～（虽然浙大计算机群和PAT算法讨论群里很多人叫我“柳神”哈哈哈）也许和很多经验丰富的大神们相比我很渺小，但我相信只要努力终会创造价值的~本博客从大一创建至今，旨在记录下 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. 1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1069. THE BLACK HOLE OF NUMBERS (20)-PAT甲级真题 …TRANSLATE THIS

PAGE

The Black Hole of Numbers (20)-PAT甲级真题 – 柳婼 の blog. 1069. The Black Hole of Numbers (20)-PAT甲级真题. For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by taking the second number from 1041. BE UNIQUE (20)-PAT甲级真题（HASH散列） 1041. Be Unique (20)-PAT甲级真题（Hash散列）. 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 . The first one who bets on a unique number wins. 1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 已知后序与中序输出前序（先序） 已知后序与中序输出前序（先序）： 后序：3, 4, 2, 6, 5, 1（左右根） 中序：3, 2, 4, 1, 6, 5（左根右） 分析：因为后序的最后一个总是根结点，令i在中序中找到该根结点，则i把中序分为两部分，左边是左子树，右

BLOG离线版

为了下一年交年费的时候不再这么窘迫. 所以花费了很多心思整理，还包括后期的离线版本永久免费更新希望能以此获得一些blog年费资助～. 订阅方式：打赏固定金额并备注你的常用邮箱（后期的所有大版本更新都会发送到你备注的邮箱中），订阅后24小时内

柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 ABOUT ME – 日常 (๑• . •๑) – 柳婼 の BLOGTRANSLATE

THIS PAGE

About Me – 日常 (๑• . •๑) 本萌喵是一枚计算机系软件工程专业的学生～～（虽然浙大计算机群和PAT算法讨论群里很多人叫我“柳神”哈哈哈）也许和很多经验丰富的大神们相比我很渺小，但我相信只要努力终会创造价值的~本博客从大一创建至今，旨在记录下 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. 1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1069. THE BLACK HOLE OF NUMBERS (20)-PAT甲级真题 …TRANSLATE THIS

PAGE

The Black Hole of Numbers (20)-PAT甲级真题 – 柳婼 の blog. 1069. The Black Hole of Numbers (20)-PAT甲级真题. For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by taking the second number from 1041. BE UNIQUE (20)-PAT甲级真题（HASH散列） 1041. Be Unique (20)-PAT甲级真题（Hash散列）. 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 . The first one who bets on a unique number wins. 1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 已知后序与中序输出前序（先序） 已知后序与中序输出前序（先序）： 后序：3, 4, 2, 6, 5, 1（左右根） 中序：3, 2, 4, 1, 6, 5（左根右） 分析：因为后序的最后一个总是根结点，令i在中序中找到该根结点，则i把中序分为两部分，左边是左子树，右

BLOG离线版

为了下一年交年费的时候不再这么窘迫. 所以花费了很多心思整理，还包括后期的离线版本永久免费更新希望能以此获得一些blog年费资助～. 订阅方式：打赏固定金额并备注你的常用邮箱（后期的所有大版本更新都会发送到你备注的邮箱中），订阅后24小时内 1069. THE BLACK HOLE OF NUMBERS (20)-PAT甲级真 …TRANSLATE THIS

PAGE

The Black Hole of Numbers (20)-PAT甲级真题 – 柳婼 の blog. 1069. The Black Hole of Numbers (20)-PAT甲级真题. For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by taking the second number from 1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1032. SHARING (25)-PAT甲级真题 Sharing (25)-PAT甲级真题 – 柳婼 の blog. 1032. Sharing (25)-PAT甲级真题. 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

1080. GRADUATE ADMISSION (30)-PAT甲级真题 Graduate Admission (30)-PAT甲级真题 – 柳婼 の blog. 1080. Graduate Admission (30)-PAT甲级真题. It is said that in 2013, there were 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 procedure. Each applicant

will have

1095. CARS ON CAMPUS (30)-PAT甲级真题（MAP， …TRANSLATE THIS

PAGE

1095. Cars on Campus (30)-PAT甲级真题（map，排序）. Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus 1011. WORLD CUP BETTING (20)-PAT甲级真题 1011. World Cup Betting (20)-PAT甲级真题. With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Africa. Similarly, football betting fans were putting their money where their mouths were, by laying all ★书籍推荐列表

1. Java

Web技术（我按零基础入门到提高的顺序推荐，同一子标题的选其一即可，Java Web开发应该是我大学期间花费时间精力最多的一门技术了，比一开始学的iOS开发花的时间还要长，期间踩了很多坑，写了很多项目，也看了很多好书烂书，以下推荐的都是我看过 1073. 多选题常见计分法(20)-PAT乙级真题 1073. 多选题常见计分法 (20)-PAT乙级真题. 批改多选题是比较麻烦的事情，有很多不同的计分方法。. 有一种最常见的计分方法是：如果考生选择了部分正确选项，并且没有选择任何错误选项，则得到50%分数；如果考生选择了任何一个错误的选项，则不能得分 PAT | 蓝桥 | LEETCODE学习路径 & 刷题经验 你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了很多 小米有品·米物蓝牙双模键盘说明书 小米有品·米物蓝牙双模键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 文章导航. 上一

柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. ABOUT ME – 日常 (๑• . •๑) – 柳婼 の BLOGTRANSLATE

THIS PAGE

About Me – 日常 (๑• . •๑) 本萌喵是一枚计算机系软件工程专业的学生～～（虽然浙大计算机群和PAT算法讨论群里很多人叫我“柳神”哈哈哈）也许和很多经验丰富的大神们相比我很渺小，但我相信只要努力终会创造价值的~本博客从大一创建至今，旨在记录下 1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1041. BE UNIQUE (20)-PAT甲级真题（HASH散列） 1041. Be Unique (20)-PAT甲级真题（Hash散列）. 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 . The first one who bets on a unique number wins. 1095. CARS ON CAMPUS (30)-PAT甲级真题（MAP， …TRANSLATE THIS

PAGE

1095. Cars on Campus (30)-PAT甲级真题（map，排序）. Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus 1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 洛菲键盘说明书 洛菲键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版.

柳婼 の BLOG

你们要不要考虑也节省一下时间～ 这份PDF题目叫做 《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 by 柳婼》， 希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～. 一年前看过我blog的人应该知道，我 曾经开通过知乎的值乎付费咨询 ，大概开通了大半年时间，期间也收到了 1033. TO FILL OR NOT TO FILL (25)-PAT甲级真题（贪心 …TRANSLATE THIS PAGE 1033. To Fill or Not to Fill (25)-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 different price. ABOUT ME – 日常 (๑• . •๑) – 柳婼 の BLOGTRANSLATE

THIS PAGE

About Me – 日常 (๑• . •๑) 本萌喵是一枚计算机系软件工程专业的学生～～（虽然浙大计算机群和PAT算法讨论群里很多人叫我“柳神”哈哈哈）也许和很多经验丰富的大神们相比我很渺小，但我相信只要努力终会创造价值的~本博客从大一创建至今，旨在记录下 1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1100. MARS NUMBERS (20)-PAT甲级真题 People on Mars count their numbers with base 13: Zero on Earth is called “tret” on Mars. The numbers 1 to 12 on Earch is called “jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec” on

Mars, respectively.

1022. DIGITAL LIBRARY (30)-PAT甲级真题（MAP映射） …TRANSLATE

THIS PAGE

1022. Digital Library (30)-PAT甲级真题（map映射）. A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting

books

1041. BE UNIQUE (20)-PAT甲级真题（HASH散列） 1041. Be Unique (20)-PAT甲级真题（Hash散列）. 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 . The first one who bets on a unique number wins. 1095. CARS ON CAMPUS (30)-PAT甲级真题（MAP， …TRANSLATE THIS

PAGE

1095. Cars on Campus (30)-PAT甲级真题（map，排序）. Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out times and the plate numbers of the cars crossing the gate. Now with all the information available, you are supposed to tell, at any specific time point, the number of cars parking on campus 1001. 害死人不偿命的(3N+1)猜想 (15)-PAT乙级真题 …TRANSLATE THIS PAGE 1001. 害死人不偿命的 (3n+1)猜想 (15)-PAT乙级真题. 对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1)砍掉一半。. 这样一直反复砍下去，最后一定在某一步得到n=1。. 卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时 洛菲键盘说明书 洛菲键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 1046. SHORTEST DISTANCE (20)-PAT甲级真题 1046. Shortest Distance (20)-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. For each case, the first line contains an integer N (in ), followed by

N

1080. GRADUATE ADMISSION (30)-PAT甲级真题 Graduate Admission (30)-PAT甲级真题 – 柳婼 の blog. 1080. Graduate Admission (30)-PAT甲级真题. It is said that in 2013, there were 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 procedure. Each applicant

will have

1007. 素数对猜想 (20)-PAT乙级真题 1007. 素数对猜想 (20)-PAT乙级真题. 让我们定义 dn 为：dn = pn+1 – pn，其中 pi 是第i个素数。. 显然有 d1=1 且对于n>1有 dn 是偶数。. “素数对猜想”认为“存在无穷多对相邻且差为2的素数”。. 现给定任意正整数N (< 105)，请计算不超过N的满足猜想的素数对的个数 洛菲键盘说明书 洛菲键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. ★书籍推荐列表

1. Java

Web技术（我按零基础入门到提高的顺序推荐，同一子标题的选其一即可，Java Web开发应该是我大学期间花费时间精力最多的一门技术了，比一开始学的iOS开发花的时间还要长，期间踩了很多坑，写了很多项目，也看了很多好书烂书，以下推荐的都是我看过

打赏感谢名单

柳婼 の blog. 我不管，反正我最萌～ 菜单和挂件 1004. 成绩排名 (20)-PAT乙级真题 成绩排名 (20)-PAT乙级真题 – 柳婼 の blog. 1004. 成绩排名 (20)-PAT乙级真题. 读入n名学生的姓名、学号、成绩，分别输出成绩最高和成绩最低学生的姓名和学号。. 输入格式：. 每个测试输入包含1个测试用例，格式为. 第1行：正整数n. 第2行：第1个学生的姓名 学号 小米有品·米物蓝牙双模键盘说明书 小米有品·米物蓝牙双模键盘说明书. 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼. 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼. 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版. 文章导航. 上一 已知后序与中序输出前序（先序） 已知后序与中序输出前序（先序）：. 后序：3, 4, 2, 6, 5, 1（左右根）. 中序：3, 2, 4, 1, 6, 5（左根右）. 分析：因为后序的最后一个总是根结点，令i在中序中找到该根结点，则i把中序分为两部分，左边是左子树，右边是右子树。. 因为是输出先序（根左右），所以

BLOG离线版

为了下一年交年费的时候不再这么窘迫. 所以花费了很多心思整理，还包括后期的离线版本永久免费更新希望能以此获得一些blog年费资助～. 订阅方式：打赏固定金额并备注你的常用邮箱（后期的所有大版本更新都会发送到你备注的邮箱中），订阅后24小时内

跳至内容

柳婼 の BLOG

我不管，反正我最萌～

菜单和挂件

* About Me – 日常 (๑• . •๑)

* blog离线版

* PAT | 蓝桥 | LeetCode学习路径 & 刷题经验 * 《从C语言转C++简明教程 v5.0+》

* Code

* Books

* ★书籍推荐列表 * ❤打赏感谢名单

标签

01背包

C++ DFS

Dijkstra

GPLT

ios

iOS开发

LeetCode

OJ MacBook

Objective-C

OJ

PAT

POJ

Python

STL

Sublime

Swift

Xcode

人性

传记

动态规划

历史

天梯赛

思维导图

恋爱

成长

操作系统

散文

数据结构

文艺

最短路径

汇编

知识点整理

离散数学

科普

算法

编程

自我管理

蓝桥杯

计算机组成原理

读书笔记

贪心算法

软件体系结构

软件工程

软件项目管理

PAT | 蓝桥 | LEETCODE学习路径 & 刷题经验 你们要不要考虑也节省一下时间～ 这份PDF题目叫做《PAT | 蓝桥 | LEETCODE学习路径 &

刷题经验 BY

柳婼》，希望可以帮助学习算法路上的小可爱们节约时间、少踩一些坑、多走一些捷径～ 一年前看过我blog的人应该知道，我曾经开通过知乎的值乎付费咨询，大概开通了大半年时间，期间也收到了很多咨询，绝大多数提问的话题都是“PAT、蓝桥、LeetCode怎么学如何刷题”，我也一一认真做了回答（绝大多数回答都在半小时以上），但是值乎的回答只能够发布语音，而且有回答时效，提问也有字数限制，后来问的人越来越多，我一天要花数小时在知乎回答上，而且回答的都是几乎相同的问题…对于分享算法经验来说，短短半小时确实不够，很多观点无法详细解释缘由，值乎一对一咨询确实不是一个很好的分享算法经验的平台，听者也很难短时间形成对问题答案的清晰理解，所以后来半年前我就关闭了知乎咨询的功能～不过还是有很多小可爱通过各种渠道向我咨询经验等问题，所以我花了好多天时间将这些问题的回答、刷题笔记、经验全都整理在了一份PDF中～这些问题包括： 里面不仅有关于这些竞赛的介绍、应该看哪些书、如何刷题，还有我自己刷算法过程中整理的笔记，目录如下： 这份经验一共3万7千字（想当年800字的高考作文都写那么辛苦…）在算法路上，我能帮的只有这么多了…希望能帮助你们少走很多弯路，少踩很多坑～剩下的就是靠你们自己刷题啦～还和离线版订阅获取的方式一样…打赏29元并备注邮箱号即可…打赏二维码在每篇博客文章点进去的最下面…24小时内发送到邮箱…（一般一两个小时就收到了～）时间仓促，后期还会对这份文档的内容进行扩充完善…到时候有版本更新还会继续发送到邮箱中～感谢支持与信任～ 发布于 2019-07-072019-09-11

分类 Code

PAT 1155 HEAP PATHS （30 分）- 甲级 IN COMPUTER SCIENCE, A HEAP IS A SPECIALIZED TREE-BASED DATA STRUCTURE THAT SATISFIES THE HEAP PROPERTY: IF P IS A PARENT NODE OF C, THEN THE KEY (THE VALUE) OF P IS EITHER GREATER THAN OR EQUAL TO (IN A MAX HEAP) OR LESS THAN OR EQUAL TO (IN A MIN HEAP) THE KEY OF C. A COMMON IMPLEMENTATION OF A HEAP IS THE BINARY HEAP, IN WHICH THE TREE IS A COMPLETE BINARY TREE. (QUOTED FROM WIKIPEDIA AT HTTPS://EN.WIKIPEDIA.ORG/WIKI/HEAP_(DATA_STRUCTURE)) ONE THING FOR SURE IS THAT ALL THE KEYS ALONG ANY PATH FROM THE ROOT TO A LEAF IN A MAX/MIN HEAP MUST BE IN NON-INCREASING/NON-DECREASING

ORDER.

YOUR JOB IS TO CHECK EVERY PATH IN A GIVEN COMPLETE BINARY TREE, IN ORDER TO TELL IF IT IS A HEAP OR NOT. INPUT SPECIFICATION: EACH INPUT FILE CONTAINS ONE TEST CASE. FOR EACH CASE, THE FIRST LINE GIVES A POSITIVE INTEGER N (1SAMPLE INPUT 1:

8

98 72 86 60 65 12 23 50

SAMPLE OUTPUT 1:

98 86 23

98 86 12

98 72 65

98 72 60 50

MAX HEAP

SAMPLE INPUT 2:

8

8 38 25 58 52 82 70 60

SAMPLE OUTPUT 2:

8 25 70

8 25 82

8 38 52

8 38 58 60

MIN HEAP

SAMPLE INPUT 3:

8

10 28 15 12 34 9 8 56

SAMPLE OUTPUT 3:

10 15 8

10 15 9

10 28 34

10 28 12 56

NOT HEAP

题目大意：给出一颗完全二叉树，打印出从根节点到所有叶节点的路径，打印顺序先右后左，即先序遍历的镜像。然后判断该树是大顶堆、小顶堆或者不是堆～ 分析：1.深搜打印出所有路径（从右往左，即先序的镜像），vector保存一路上的节点，通过push和pop回溯，维护路径，index <= n是对只有左叶节点没有右叶节点的点特判 2.判断是否为堆：从第二个节点开始遍历，如果比父节点小，就不是小顶堆，如果比父节点大，就不是大顶堆～ #include #include using namespace std; vector v; int a, n, isMin = 1, isMax = 1; void dfs(int index) { if (index * 2 > n && index * 2 + 1 > n) { if (index <= n) { for (int i = 0; i < v.size(); i++) printf("%d%s", v, i != v.size() - 1 ? " " : "\n"); } } else { v.push_back(a); dfs(index * 2 + 1); v.pop_back(); v.push_back(a); dfs(index * 2); v.pop_back(); } } int main() { cin >> n; for (int i = 1; i <= n; i++) scanf("%d", &a); v.push_back(a); dfs(1); for (int i = 2; i <= n; i++) { if (a > a) isMin = 0; if (a < a) isMax = 0; } if (isMin == 1) printf("Min Heap"); else printf("%s", isMax == 1 ? "Max Heap" : "Not Heap"); return 0; }

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

#include

#include

using namespace std;

vector v;

int a, n, isMin = 1, isMax = 1; void dfs(int index) { if (index * 2 > n && index * 2 + 1 > n) {

if (index <= n) {

for (int i = 0; i < v.size(); i++) printf("%d%s", v, i != v.size() - 1

? " " : "\n");

}

} else {

v.push_back(a);

dfs(index * 2 + 1);

v.pop_back();

v.push_back(a);

dfs(index * 2);

v.pop_back();

}

}

int main() {

cin >> n;

for (int i = 1; i <= n; i++)

scanf("%d", &a);

v.push_back(a);

dfs(1);

for (int i = 2; i <= n; i++) { if (a > a) isMin = 0; if (a < a) isMax = 0;

}

if (isMin == 1)

printf("Min Heap");

else

printf("%s", isMax == 1 ? "Max Heap" : "Not Heap");

return 0;

}

发布于 2019-03-192019-03-20

分类 Code

标签 堆

在二叉树中有两个结点M和N，若M是N的祖先，则使用后序遍历可以找到从M到N的路径 首先需要理解的是，前中后序遍历都是通过递归的方式，将后来需要用到的结点保存在栈中，比如下面这颗树： 如果是前序遍历，根左右，过程是：根节点m入栈并输出，访问m的左孩子a，a入栈并输出，访问a的左孩子c，c入栈并输出，c没有左孩子，无元素入栈，c没有右孩子，无元素入栈，c出栈，此时栈顶元素为a，访问a元素的右孩子d，d入栈并输出，d没有左孩子，无元素入栈，d没有右孩子，无元素入栈，d出栈，a左右子树都访问完了所以出栈，现在栈顶元素是M，M已经没有作用了所以出栈，访问m的右孩子b，m的右孩子b入栈并输出，接着访问b的左孩子e，e入栈并输出…… 如果中序遍历，左根右，过程是：根节点m入栈，访问m的左孩子，所以m的左孩子a入栈，访问a的左孩子，所以a的左孩子c入栈，c没有左孩子，c现在输出并出栈，c没有右孩子所以没有元素入栈，现在栈顶元素是a，a输出并出栈，a的右孩子d入栈，此时d没有左孩子所以没有元素入栈，d输出并出栈，d没有右孩子所以没有元素入栈，现在栈顶元素是M，M输出，此时M已经没有作用了所以出栈，m的右孩子b入栈，访问b的左孩子，所以b的左孩子e入栈…… 所以在前序和中序的过程中，如果n在m的右子树部分，遍历过程中找到了n，但是m已经不在栈中，因为栈中只会保留等会需要用到的e和b结点，而m已经完成了访问根结点和m的左子树的任务，已经被出栈，所以无法追溯N如何走到M 但是后序遍历就不一样啦，后序的顺序是左右根，所以只要m的左右子树还没遍历完成，m就不能出栈，在遍历m的左右子树过程中，无论在m的左边还是右边找到了n，都可以直接返回然后根据栈中的路径让N找到回到M的路，这样就能找到m到n的路径～ 所以一旦n在m的右子树，且离的较远，m就会在前序和中序的过程中因为已经完成了访问左、访问根的任务，而被栈遗忘，让找到了n的时候也不知怎么回到m……而只有后序会让作为祖先（子树的根）的m永远被铭记直到n找到m为止… 发布于 2019-03-112019-04-16

分类 Code

标签 树的遍历

【IOS】TAB BAR 的 ITEM 按钮的像素大小要求 根据苹果官方人机界面指南（Human Interface Guidelines）

可以得知：

IOS系统会根据设备和方向显示两种标签栏：常规（REGULAR）和紧凑（COMPACT），所以在设置自定义TAB

BAR

ITEM的时候也应该包含常规和紧凑两种不同的尺寸～ 根据图形是圆形、方形、宽形、高形，像素也有不同的要求： 如果图标是圆形的，应该提供：25PT@2X、25PT@3X、18PT@2X、18PT@3X 如果图标是方形的，应该提供：23PT@2X、23PT@3X、17PT@2X、17PT@3X 如果图标是宽形的，应该提供：31PT@2X、31PT@3X、23PT@2X、23PT@3X 如果图标是高形的，应该提供：28PT@2X、28PT@3X、20PT@2X、20PT@3X 以下是完整表格～ 发布于 2019-01-182019-03-20

分类 Code

标签 iOS开发

文章导航

页 1 页 2 … 页 388

下一页

苏ICP备15038923号