将数组所有的数放入哈希表,随后从 1 开始依次枚举正整数,并判断其是否在哈希表中;但是这样的做法不符合题目的空间要求:
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
unordered_set<int> hash;
for (auto x : nums) hash.insert(x);
int res = 1;
while (hash.count(res)) res++;
return res;
}
};
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
int n = nums.size();
for (int i = 0; i < n; i++) {
while (nums[i] > 0 && nums[i] <= n && nums[i] != nums[nums[i] - 1])
swap(nums[i], nums[nums[i] - 1]);
}
for (int i = 0; i < n; i++) {
if (nums[i] != i + 1)
return i + 1;
}
return n + 1;
}
};
42. 接雨水
特别经典的接雨水,在很多公司的机试题有考过,推荐题解。
class Solution {
public:
int trap(vector<int>& height) {
stack<int> stk;
int res = 0;
for (int i = 0; i < height.size(); i ++ ) {
int last = 0;
while (stk.size() && height[stk.top()] <= height[i]) {
res += (height[stk.top()] - last) * (i - stk.top() - 1);
last = height[stk.top()];
stk.pop();
}
if (stk.size()) res += (i - stk.top() - 1) * (height[i] - last