Leetcode Day3

1.两数之和【简单】

https://leetcode-cn.com/problems/two-sum/

• 哈希

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int,int> mp;
        for(int i=0; i<nums.size(); i++)
        {
            if(mp[target-nums[i]]>0)
            {
                return {i, mp[target-nums[i]]-1};
            }
            mp[nums[i]]=i+1;
        }
        return{-1,-1};
    }
};             

215.数组中的第K个最大元素【中等】

https://leetcode-cn.com/problems/kth-largest-element-in-an-array/

• priority_queue

priority_queue<Type, Container, Functional>

Type为数据类型， Container为保存数据的容器，Functional为元素比较方式。

如果不写后两个参数，那么容器默认用的是vector，比较方式默认用operator <，也就是优先队列是大顶堆，队头元素最大（==less<int>）。

class Solution {
public:
    int findKthLargest(vector<int>& nums, int k) {
        priority_queue<int, vector<int>, greater<int>> pq;
        for(int i=0; i<nums.size(); i++)
        {
            if(pq.size()<k)
                pq.push(nums[i]);
            else if(pq.top()<nums[i])
            {
                pq.pop();
                pq.push(nums[i]);
            }
        }
        return pq.top();
    }
};

15.三数之和【中等】

https://leetcode-cn.com/problems/3sum/

• 双指针

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>>res;
        if(nums.size()<3)
            return res;
        sort(nums.begin(), nums.end());  // -1 -1 0 1 2 -4
        for(int i=0; i<nums.size()-2; i++)
        {
            if(nums[i]>0)
            {
                return res;
            }
            int l = i+1;
            int r = nums.size()-1;
            while(l<r)
            {
                int sum = nums[i]+nums[r]+nums[l];
                if(sum==0)
                {
                    res.push_back({nums[i], nums[l], nums[r]});
                    while(l+1<nums.size()&&nums[l]==nums[l+1])
                        l++;
                    while(r>i&&nums[r]==nums[r-1])
                        r--;
                    l++;
                    r--;
                }
                if(sum>0)
                    r--;
                if(sum<0)
                    l++;
                while(i<nums.size()-2&&nums[i]==nums[i+1]) 
                    // 放在最后可以防止nums[i]作为第一个数出现多次
                    i++;
            }
        }
        return res;
    }
};

912.排序数组（此题请至少尝试2种及以上的排序算法）【中等】

https://leetcode-cn.com/problems/sort-an-array/

• 快排（需要random_shuffle）

class Solution {
public:
    void quicksort(vector<int>& nums, int l, int r)
    {
        if(l>r)
            return;
        int cur = nums[l];
        int i = l;
        int j = r;
        while(i!=j)
        {
            while(nums[j]>=cur&&i<j)
                j--;
            while(nums[i]<=cur&&i<j)
                i++;
            swap(nums[i], nums[j]);
        }
        nums[l] = nums[i];
        nums[i] = cur;
        quicksort(nums, l, i-1);
        quicksort(nums, i+1, r);
    }
    vector<int> sortArray(vector<int>& nums) {
        random_shuffle(nums.begin(),nums.end());
        quicksort(nums, 0, nums.size()-1);
        return nums;
    }
};

• 归并排序

class Solution {
public:
    vector<int>tmp;
    void merge(vector<int>&nums, int l, int r, int mid)
    {
        for(int i=l; i<=r; i++)
        {
            tmp[i] = nums[i];
        }
        int i=l;
        int j=mid+1;
        for(int p=l; p<=r; p++)
        {
            if(i==mid+1)
                nums[p]=tmp[j++];
            else if(j==r+1)
                nums[p]=tmp[i++];
            else if(tmp[i]>tmp[j])
                nums[p]=tmp[j++];
            else if(tmp[j]>=tmp[i])
                nums[p]=tmp[i++];
        }
    }
    void merge_sort(vector<int>&nums, int l, int r)
    {
        if(l==r)
            return;
        int mid = l + (r-l)/2;
        merge_sort(nums, l, mid);
        merge_sort(nums, mid+1, r);
        merge(nums, l, r, mid);
    }
    vector<int> sortArray(vector<int>& nums) {
        tmp.reserve(nums.size());
        merge_sort(nums, 0, nums.size()-1);
        return nums;
    }
};