题目 题解 class LRUCache { private: int capacity; list<pair<int,int>>cache; unordered_map<int,list<pair<int,int>>::iterator> mp; public: L
Published on 2024-09-27
题目 题解 搬移官方题解 /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nu
Published on 2024-09-26
Published on 2023-04-24
Published on 2022-03-20
class Solution {public: void reorderList(ListNode* head) { if(!head)return ; vector<ListNode*>v; ListNode*cur=head;
Published on 2022-03-18
Published on 2022-03-18
Published on 2022-03-01
哈希/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Published on 2022-03-01
Published on 2022-03-01
Published on 2022-02-27
-ca9fe781c2d244deaabd5ebe8c1c61a1.JPG)
