链表
意难平丶NJUPT
这个作者很懒,什么都没留下…
展开
-
剑指offer18.删除链表结点
刷题自用0518代码class Solution {public: ListNode* deleteNode(ListNode* head, int val) { ListNode*first=head; ListNode*second=head->next; if(first->val==val) return first->next; while(second!=NULL&&second-&g原创 2022-05-18 20:29:40 · 137 阅读 · 0 评论 -
剑指offer53.两个链表的第一个交点
刷题自用0515代码class Solution {public: ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { ListNode *a=headA; ListNode *b=headB; while(headA!=headB){ headA=headA==NULL?b:headA->next; headB=headB==N原创 2022-05-15 16:29:49 · 108 阅读 · 0 评论 -
剑指offer06.从尾到头打印链表
刷题自用0513代码class Solution {public: vector<int> reversePrint(ListNode* head) { vector<int> res; while(head){ res.push_back(head->val); head=head->next; } reverse(res.begin(),res原创 2022-05-13 14:51:43 · 136 阅读 · 0 评论 -
剑指offer 06.从尾到头打印链表,刷题自用0505
代码class Solution {public: vector<int> reversePrint(ListNode* head) { vector<int>res; while(head){ res.push_back(head->val); head=head->next; } reverse(res.begin(),res.end());原创 2022-05-05 16:06:47 · 428 阅读 · 0 评论