From 7d3ec8447afde81fb065499422d37e180b256d85 Mon Sep 17 00:00:00 2001 From: Vally Date: Fri, 20 May 2016 14:48:38 +0300 Subject: [PATCH] fixed typo --- .../cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp b/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp index da8fe9046..0b20ecc77 100644 --- a/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp +++ b/algorithms/cpp/intersectionOfTwoArrays/intersectionOfTwoArrays.cpp @@ -22,7 +22,7 @@ class Solution { for(int i = 0; i < nums1.size(); i++) inter1.insert(nums1[i]);//get all of the unique elements in nums1 sorted for(int i = 0; i < nums2.size(); i++) - if(inter1.find(nums2[i]) != inter1.end())//search nums1 in O(logN) + if(inter1.find(nums2[i]) != inter1.end())//search inter1 in O(logN) inter2.insert(nums2[i]);//populate the intersection set for(set::iterator it = inter2.begin(); it != inter2.end(); ++it) solution.push_back(*it);//copy the set into a vector