自由之翼Az - 博客园

2019年9月8日

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

posted @ 2019-09-08 23:05 自由之翼Az 阅读(223) 评论(0) 推荐(0) 编辑

PAT甲级——A1133 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 阅读全文

posted @ 2019-09-08 22:18 自由之翼Az 阅读(238) 评论(0) 推荐(0) 编辑

PAT甲级——A1132 Cut Integer

摘要： Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z = 1673 阅读全文

posted @ 2019-09-08 20:20 自由之翼Az 阅读(195) 评论(0) 推荐(0) 编辑

2019年9月7日

PAT甲级——A1131 Subway Map【30】

摘要： In the big cities, the subway systems always look so complex to the visitors. To give you some sense, the following figure shows the map of Beijing su 阅读全文

posted @ 2019-09-07 23:54 自由之翼Az 阅读(384) 评论(0) 推荐(0) 编辑

PAT甲级——A1130 Infix Expression【25】

摘要： Given a syntax tree (binary), you are supposed to output the corresponding infix expression, with parentheses reflecting the precedences of the operat 阅读全文

posted @ 2019-09-07 22:47 自由之翼Az 阅读(215) 评论(0) 推荐(0) 编辑

PAT甲级——A1129 Recommendation System【25】

摘要： Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that 阅读全文

posted @ 2019-09-07 21:22 自由之翼Az 阅读(277) 评论(0) 推荐(0) 编辑

PAT甲级——A1128 N Queens Puzzle【20】

摘要： The "eight queens puzzle" is the problem of placing eight chess queens on an 8 chessboard so that no two queens threaten each other. Thus, a solution 阅读全文

posted @ 2019-09-07 20:43 自由之翼Az 阅读(169) 评论(0) 推荐(0) 编辑

2019年9月6日

PAT甲级——A1127 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 ino 阅读全文

posted @ 2019-09-06 22:03 自由之翼Az 阅读(183) 评论(0) 推荐(0) 编辑

PAT甲级——A1126 Eulerian Path【30】

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

posted @ 2019-09-06 21:06 自由之翼Az 阅读(191) 评论(0) 推荐(0) 编辑

PAT甲级——A1125 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 阅读全文

posted @ 2019-09-06 20:18 自由之翼Az 阅读(144) 评论(0) 推荐(0) 编辑

自由の翼

公告