vision_vvvv

分类

题解(3)

/ 注册

全部文章（共3篇）

题解

第一题直接return k第二题不会第三题def tree1(a): res = 0 n = len(a) for i in range(n): if i2+1 < n: res += (a[i] ^ a[i2+1]) ...

2020-07-18

0 689

哈希map

/* struct ListNode { int val; struct ListNode *next; ListNode(int x) : val(x), next(NULL) { } };*/ class Solution { public...

2020-01-30

3 716

unordered_map

class Solution { public: int MoreThanHalfNum_Solution(vector<int> numbers) { ...

2020-01-28

2 825