2019年9月8日
PAT甲级——A1134 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 阅读全文
posted @ 2019-09-08 23:05 自由之翼Az 阅读(233) 评论(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 阅读(264) 评论(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 阅读(204) 评论(0) 推荐(0)