LeetCode 350 Intersection of Two Arrays II

Tag: 数组类题目 LeetCode Posted on 2022-03-08 19:14:10 Edited on 2022-03-08 19:14:10 Views: 155

概述

https://leetcode.com/problems/intersection-of-two-arrays-ii/

排序法 + 双指针

class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        sort(nums1.begin(), nums1.end());
        sort(nums2.begin(), nums2.end());
        vector<int> ans;
        int i = 0, j = 0;
        while (i < nums1.size() && j < nums2.size()) {
            if (nums1[i] == nums2[j]) {
                ans.push_back(nums1[i]);
                i ++;
                j ++;
            } else if (nums1[i] < nums2[j]) {
                i ++;
            } else {
                j ++;
            }
        }
        return ans;
    }
};

未经允许,禁止转载,本文源站链接:https://iamazing.cn/