Leetcode day1

2026-05-16 19:35:22 +00:00 · 2026-01-25 12:41:33 +05:30
parent 686d174f19
commit 245116d181
14 changed files with 168 additions and 0 deletions
@@ -0,0 +1,40 @@
+class Solution {
+public:
+    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
+        int a = nums1.size();
+        int b = nums2.size();
+        int i=0,j=0,m1=0,m2=0;
+
+        for(int count=0;count<=(a+b)/2;count++){
+            m2=m1;
+            if(i!=a && j!=b){
+                if(nums1[i]<nums2[j]){
+                    m1= nums1[i++];
+                }
+                else{
+                     m1 = nums2[j++];
+                     }
+            }
+            else if(i<a){
+                m1 = nums1[i++];
+            }
+            else  {
+                m1 = nums2[j++];
+            }
+           
+
+                
+            
+
+            
+        }
+         if((a+b)%2==1){
+                return (double)m1;
+            }
+            else{
+                return (m1+m2)/2.0;
+            }
+      
+        }
+    
+};