From 507b588583b3f8c9493f3124d252bb9c3ca84e02 Mon Sep 17 00:00:00 2001
From: Shashank Singh <ssingh0271@gmail.com>
Date: Wed, 5 Oct 2022 09:35:20 +0530
Subject: [PATCH] added java Solution for Leetcode #4

---
 Java/Leetcode-Median-of-2-sorted-arrays.java | 60 ++++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 Java/Leetcode-Median-of-2-sorted-arrays.java

diff --git a/Java/Leetcode-Median-of-2-sorted-arrays.java b/Java/Leetcode-Median-of-2-sorted-arrays.java
new file mode 100644
index 00000000..b290667e
--- /dev/null
+++ b/Java/Leetcode-Median-of-2-sorted-arrays.java
@@ -0,0 +1,60 @@
+// Problem link : https://leetcode.com/problems/median-of-two-sorted-arrays/description
+
+class Solution {
+public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+int arr[]=new int[nums1.length+nums2.length];
+
+    int j=0;
+    int i=0;
+        int r=0;
+    while(i<nums1.length && j<nums2.length)
+    {
+     if(nums1[i]<nums2[j])
+     {
+         arr[r]=nums1[i];
+         i++;
+         r++;
+     }
+        else if (nums1[i]>nums2[j])
+        {
+          arr[r]=nums2[j];
+         j++;
+            r++;
+        }
+        else
+        {
+            arr[r]=nums1[i];
+            r++;
+            arr[r]=nums2[j];
+            r++;
+            i++;
+            j++;
+        }
+        
+    }
+    while(i<nums1.length)
+    {
+        arr[r]=nums1[i];
+        r++;
+        i++;
+    }
+    while(j<nums2.length)
+    {
+        arr[r]=nums2[j];
+        r++;
+        j++;
+    }
+    if(arr.length%2==0)
+    {
+
+      double a1= Double.valueOf(  arr[arr.length/2]);
+        double a2=Double.valueOf(arr[arr.length/2-1]);
+        double d= (a1+a2)/2;
+    return d;
+    }
+    else
+    {
+        return Double.valueOf(arr[arr.length/2]);
+    }
+}
+}
\ No newline at end of file