Time: 551 ms (6.88%) | Memory: 13 MB (80.49%) - LeetSync

Author: kaleaditya779

350-intersection-of-two-arrays-ii/intersection-of-two-arrays-ii.cpp

@@ -0,0 +1,30 @@
+class Solution {
+public:
+    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
+      
+            int n1=0;
+            int n2=0;
+            vector<int> result;
+    
+            while (n1<nums1.size() && n2<nums2.size()){
+                if (nums1[n1]==nums2[n2]) {
+                    result.push_back(nums1[n1]);
+                    nums1.erase(nums1.begin()+n1);
+                    nums2.erase(nums2.begin()+n2);
+                    cout<<nums1.size()<<" "<<n1;
+                   
+                        n1=0;
+                        n2=0;
+                    
+                } else {
+                    n1++;
+                    if (n1==nums1.size()) {
+                        n1=0;
+                        n2++;
+                    }
+                }
+
+            }
+            return result;
+    }
+};