随笔档案「2021年7月」 - VigilYang

公告

07 2021 档案

MOOC数据结构PTA-02-线性结构4 Pop Sequence (25 分)

摘要：##题目 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 gi 阅读全文

posted @ 2021-07-18 15:14 VigilYang 阅读(111) 评论(0) 推荐(0)

MOOC数据结构PTA-02-线性结构3 Reversing Linked List (25 分)

摘要：##题目 Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4 阅读全文

posted @ 2021-07-15 15:11 VigilYang 阅读(123) 评论(0) 推荐(0)