2020年3月5日
pat 1110 Complete Binary Tree (25分) 判断一棵二插树是否是完全二叉树
摘要： Given a tree, you are supposed to tell if it is a complete binary tree. Input Specification: Each input file contains one test case. For each case, th 阅读全文
posted @ 2020-03-05 20:21 my日常work 阅读(361) 评论(0) 推荐(0)
pat 1074 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→5→6, 阅读全文
posted @ 2020-03-05 12:55 my日常work 阅读(211) 评论(0) 推荐(0)