jonathan_joestar的博客

In an AVL tree, it is impossible to have this situation that the balance factors of a node and both of its children are all +1.错的我sjc大佬所说的左边 高是3 右边是2 还是平衡的

1-4在收费公路重构问题（Turnpike Reconstruction Problem）中，给定距离集合 D = { 1, 2, 2, 3, 4, 4, 5, 5, 7, 9 }，在距离原点 4 个单位距离处必定存在一个收费站。(3分)T 选对Fhttps://kdocs.cn/l/ccUbZhYeMcq0[金山文档] 构问题（Turnpike Reconstruction Problem）中，给定距离集合 D = { 1, 2, 2, 3, 4, 4, 5, 5, 7, 9 }，在距离原点

文档：When inserting 1, 2, 3, 6, 5, and 4 …链接：http://note.youdao.com/noteshare?id=019b5b95625507cfcd7b68185e120218

6-3 链表拼接 (20分)本题要求实现一个合并两个有序链表的简单函数。链表结点定义如下：struct ListNode { int data; struct ListNode *next;};函数接口定义：struct ListNode *mergelists(struct ListNode *list1, struct ListNode *list2);其中list1和list2是用户传入的两个按data升序链接的链表的头指针；函数mergelists将两个链表合并成一个

7-3 Pop Sequence (25分)参考了博客 https://blog.youkuaiyun.com/whzyb1991/article/details/46663867但是我看不懂(╥╯^╰╥)题目链接 ：https://pintia.cn/problem-sets/16/problems/665Given a stack which can keep M numbers at most...