LeetCode 0001 - xxx
# Hints
xxx
# 题面
Difficulty | Time Complexity Limit | Extra-Memory Complexity Limit |
---|---|---|
Medium |
xxx
# 题意
xxx
# 题解
xxx
# AC代码
class Solution {
public:
vector<int> twoSum(vector<int> & nums, int target) {
// 求解
unordered_map<int, int> ump;
for (int i = 0; i < nums.size(); i ++) {
// 查找
int val = target - nums[i];
if (ump.find(val) != ump.end()) {
return vector<int>({ump[val], i});
}
// 插入
ump[nums[i]] = i;
}
// 返回
return vector<int>({-1, -1});
}
};
- 01
- Reading Papers - Kernel Concurrency06-01
- 02
- Linux Kernel - Source Code Overview05-01
- 03
- Linux Kernel - Per-CPU Storage05-01