MichaelJ

``` class Solution { public: int fourSumCount(vector& nums1, vector& nums2, vector& nums3, vector& n

``` class Solution { public: vector twoSum(vector& nums, int target) { unordered_map map; for(int i=

``` set class Solution { public: vector intersection(vector& nums1, vector& nums2) { unordered_set r

class Solution { public: bool isAnagram(string s, string t) { int hash[26] = {0}; for (size_t i = 0;

``` class Solution { public: ListNode *detectCycle(ListNode *head) { //n=1时 ListNode* fastIndex = he

``` class Solution { public: ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { ListN

``` class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode* dummyHead

双指针法 // @lc code=start /** * Definition for singly-linked list. * struct ListNode { * int val

class MyLinkedList { public: // 定义链表节点结构体 struct LinkedNode { int val; LinkedNode* next; LinkedNode(