摘要: 56. 合并区间 https://leetcode.cn/problems/merge-intervals/description/?envType=study-plan-v2&envId=top-100-liked 该怎么排序区间 vector<vector>& intervals sort(in 阅读全文
posted @ 2024-10-13 23:55 Leome 阅读(22) 评论(0) 推荐(0)
摘要: 一些技巧题 只出现一次数字 异或做就行,简单 for _, n := range nums { ans ^= n } https://leetcode.cn/problems/single-number?envType=study-plan-v2&envId=top-100-liked 阅读全文
posted @ 2024-09-25 21:48 Leome 阅读(26) 评论(0) 推荐(0)
摘要: typedef struct { int *arr; int front; int tail; int size; } MyCircularQueue; MyCircularQueue* myCircularQueueCreate(int k) { MyCircularQueue *obj = (M 阅读全文
posted @ 2023-03-01 12:35 Leome 阅读(40) 评论(0) 推荐(0)