A-Little-Nut

2018年1月23日

摘要： 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 阅读全文

posted @ 2018-01-23 11:52 A-Little-Nut 阅读(174) 评论(0) 推荐(0) 编辑

PAT 1052. Linked List Sorting

摘要： 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 阅读全文

posted @ 2018-01-23 09:40 A-Little-Nut 阅读(131) 评论(0) 推荐(0) 编辑

2018年1月22日

PAT 1051. Pop Sequence

摘要： 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 s 阅读全文

posted @ 2018-01-22 20:08 A-Little-Nut 阅读(144) 评论(0) 推荐(0) 编辑

PAT 1050. String Subtraction

摘要： Given two strings S1 and S2, S = S1 S2 is defined to be the remaining string after taking all the characters in S2 from S1. Your task is simply to cal 阅读全文

posted @ 2018-01-22 19:26 A-Little-Nut 阅读(114) 评论(0) 推荐(0) 编辑

PAT 1049. Counting Ones

摘要： 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. F 阅读全文

posted @ 2018-01-22 19:12 A-Little-Nut 阅读(122) 评论(0) 推荐(0) 编辑

PAT 1048. Find Coins

摘要： 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 cou 阅读全文

posted @ 2018-01-22 11:59 A-Little-Nut 阅读(98) 评论(0) 推荐(0) 编辑

PAT 1047. Student List for Course

摘要： Zhejiang University has 40000 students and provides 2500 courses. Now given the registered course list of each student, you are supposed to output the 阅读全文

posted @ 2018-01-22 11:30 A-Little-Nut 阅读(132) 评论(0) 推荐(0) 编辑

PAT 1046. Shortest Distance

摘要： 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 e 阅读全文

posted @ 2018-01-22 10:46 A-Little-Nut 阅读(111) 评论(0) 推荐(0) 编辑

2018年1月21日

将博客搬至CSDN

摘要：将博客搬至CSDN 阅读全文

posted @ 2018-01-21 10:17 A-Little-Nut 阅读(102) 评论(0) 推荐(0) 编辑

338. Counting Bits(动态规划）

摘要： Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and r 阅读全文

posted @ 2018-01-21 10:07 A-Little-Nut 阅读(164) 评论(0) 推荐(0) 编辑

公告