随笔分类 -  数据结构

1
PAT Advanced 1049 Counting Ones (30 分)
摘要：题目 1049 Counting Ones (30 分) The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form o 阅读全文
posted @ 2021-03-06 22:49 tanknee 阅读(93) 评论(0) 推荐(0)
从一片森林(JavaScript)到另一片森林(C++)
摘要：从JavaScript到C Plus Plus 作为一个忠诚的Web开发者，JavaScript几乎是我这一年多以来的首选，不管是开发网站后端服务，还是开发跨端应用，我都会首选一个使用JavaScript作为主语言的框架，例如Electron，React-Native等等，毫无疑问，JavaScri 阅读全文
posted @ 2021-01-31 13:18 tanknee 阅读(340) 评论(2) 推荐(0)
PAT Nowcoder Advanced 1008 Deduplication on a Linked List
摘要：题目 Deduplication on a Linked List (25) 题目描述 Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absol 阅读全文
posted @ 2021-01-27 18:50 tanknee 阅读(112) 评论(0) 推荐(0)
PAT Nowcoder Advanced 1007 Consecutive Factors
摘要：题目 Consecutive Factors (20) 题目描述 Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be f 阅读全文
posted @ 2021-01-27 18:49 tanknee 阅读(79) 评论(0) 推荐(0)
PAT Nowcoder Advanced 1006 Cars on Campus
摘要：题目 Cars on Campus (30) 题目描述 Zhejiang University has 6 campuses and a lot of gates. From each gate we can collect the in/out times and the plate number 阅读全文
posted @ 2021-01-27 18:48 tanknee 阅读(92) 评论(0) 推荐(0)
PAT Nowcoder Advanced 1005 The Largest Generation
摘要：题目 The Largest Generation (25) 题目描述 A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the sam 阅读全文
posted @ 2021-01-27 18:47 tanknee 阅读(60) 评论(0) 推荐(0)
PAT Nowcoder Advanced 1003 Highest Price in Supply Chain
摘要：题目 1003 Highest Price in Supply Chain (25) 题目描述 A supply chain is a network of retailers（零售商）, distributors（经销商）, and suppliers（供应商）-- everyone involv 阅读全文
posted @ 2021-01-27 18:46 tanknee 阅读(66) 评论(0) 推荐(0)
PAT Nowcoder Advanced 1001 Public Bike Management
摘要：题目 1001 Public Bike Management (30) 题目描述 There is a public bike service in Hangzhou City which provides great convenience to the tourists from all ove 阅读全文
posted @ 2021-01-27 18:44 tanknee 阅读(66) 评论(0) 推荐(0)
PAT Advanced 1013 Battle Over Cities
摘要：题目 1013 Battle Over Cities (25分) It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, al 阅读全文
posted @ 2021-01-25 15:24 tanknee 阅读(68) 评论(0) 推荐(0)
PAT Advanced 1012 The Best Rank
摘要：题目 1012 The Best Rank (25分) To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C P 阅读全文
posted @ 2021-01-25 15:23 tanknee 阅读(105) 评论(0) 推荐(0)
PAT Advanced 1011 World Cup Betting
摘要：题目 1011 World Cup Betting (20分) With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best play 阅读全文
posted @ 2021-01-25 15:22 tanknee 阅读(67) 评论(0) 推荐(0)
PAT Advanced 1010 Radix
摘要：题目 1010 Radix (25分) Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal 阅读全文
posted @ 2021-01-24 16:54 tanknee 阅读(52) 评论(0) 推荐(0)
PAT Advanced 1009 Product of Polynomials
摘要：题目 1009 Product of Polynomials (25分) This time, you are supposed to find A×B where A and B are two polynomials. Input Specification: Each input file c 阅读全文
posted @ 2021-01-24 14:24 tanknee 阅读(60) 评论(0) 推荐(0)
PAT Advanced 1008 Elevator
摘要：题目 1008 Elevator (20分) The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote a 阅读全文
posted @ 2021-01-24 13:58 tanknee 阅读(53) 评论(0) 推荐(0)
PAT Advanced 1007 Maximum Subsequence Sum
摘要：题目 1007 Maximum Subsequence Sum (25分) Given a sequence of K integers { N1, N2, ..., N**K }. A continuous subsequence is defined to be { N**i, N**i+1, 阅读全文
posted @ 2021-01-23 21:03 tanknee 阅读(68) 评论(0) 推荐(0)
PAT Advanced 1006 Sign In and Sign Out
摘要：题目与翻译 1006 Sign In and Sign Out 登录和退出 (25分) At the beginning of every day, the first person who signs in the computer room will unlock the door, and t 阅读全文
posted @ 2021-01-23 15:08 tanknee 阅读(120) 评论(0) 推荐(0)
PAT Advanced 1005 Spell It Right
摘要：题目与翻译 1005 Spell It Right 拼写正确 (20分) Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of 阅读全文
posted @ 2021-01-23 13:17 tanknee 阅读(97) 评论(0) 推荐(0)
PAT Advanced 1004 Counting Leaves
摘要：题目与翻译 1004 Counting Leaves 数树叶 (30分) A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no 阅读全文
posted @ 2021-01-23 12:56 tanknee 阅读(175) 评论(0) 推荐(0)
PAT Advanced 1003 Emergency 详解
摘要：题目与翻译 1003 Emergency 紧急情况 (25分) As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scatt 阅读全文
posted @ 2021-01-21 11:03 tanknee 阅读(347) 评论(0) 推荐(0)
数据结构入门？这一篇就够了
摘要：本文首发于我的博客 算法分析 运行时间的计算分析 上界：\(O(f(N))\) 下界：\(Ω(g(N))\) 准确表达则为：\(Θ(h(N))\) 也就是说都是一个关于N的函数！ 这么做的目的是为了比较两个算法的相对增长速率 求解算法时间复杂度的步骤 找出算法中的基本语句； 算法中执行次数最多的那条 阅读全文
posted @ 2019-11-28 16:45 tanknee 阅读(976) 评论(0) 推荐(0)

1