leetcode 350. Intersection of Two Arrays II

最开始写成int i,j = 0;就报错了

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

http://www.cnblogs.com/grandyang/p/5533305.html