Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Run-time complexity O(n*m)
- // Memory complexity O(1) o O(n)?? Porque como me estoy generando result...
- vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
- int n = nums1.size();
- vector<int> result;
- for (int i = 0; i < n; ++i) {
- int times = count(nums2.begin(), nums2.end(), nums1[i]); //O(m)
- if (times > 0) {
- result.push_back(nums1[i]);
- vector<int>::iterator it = find(nums2.begin(), nums2.end(), nums1[i]);
- nums2.erase(it);
- }
- }
- return result;
- }
- // Run-time complexity O(max(nlogn, mlogm))
- // Memory complexity O(1) o O(n)?? Porque como me estoy generando result...
- vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
- vector<int> result;
- if (nums1.empty() || nums2.empty())
- return result;
- int i = 0;
- int j = 0;
- sort(nums1.begin(), nums1.end()); //O(nlogn)
- sort(nums2.begin(), nums2.end()); //O(mlogm)
- while (i < nums1.size() && j < nums2.size()) {
- if (nums1[i] < nums2[j])
- ++i;
- else{
- if (nums1[i] > nums2[j])
- ++j;
- else {
- result.push_back(nums1[i]);
- ++i;
- ++j;
- }
- }
- }
- return result;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement