摘要: 链表相交 题目链接面试题 02.07. 链表相交 - 力扣(LeetCode) class Solution { public: ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { ListNode* curA = he 阅读全文
posted @ 2022-11-04 23:25 凱風快晴 阅读(16) 评论(0) 推荐(0)
摘要: 反转链表 题目链接206. 反转链表 - 力扣(LeetCode) class Solution { public: ListNode* reverseList(ListNode* head) { ListNode* temp; ListNode* cur = head; ListNode* pre 阅读全文
posted @ 2022-11-04 00:13 凱風快晴 阅读(26) 评论(0) 推荐(0)