feat: adds nim-lang solution to lc problem: No.0004 Median of Two Sorted Arrays

solution/0000-0099/0004.Median of Two Sorted Arrays/README.md

@@ -76,7 +76,18 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
+       # concatenate the 2 lists and sort them
+        nums1 += nums2
+        nums1.sort()
+        length = len(nums1)
+        value = length/2
+        if length % 2 == 0:
+            value = int(value)
+            return (nums1[value-1] + nums1[value])/2
+        else:
+            return nums1[int(value)]
 ```
 
 ### **Java**
@@ -87,6 +98,22 @@
 
 ```
 
+### **Nim**
+
+```nim
+proc medianOfTwoSortedArrays(nums1: seq[int], nums2: seq[int]): float =
+  var
+    fullList: seq[int] = concat(nums1, nums2)
+    value: int = fullList.len div 2
+
+  fullList.sort()
+
+  if fullList.len mod 2 == 0:
+    result = (fullList[value - 1] + fullList[value]) / 2
+  else:
+    result = fullList[value].toFloat()
+```
+
 ### **...**
 
 ```

solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md

@@ -66,7 +66,18 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
+       # concatenate the 2 lists and sort them
+        nums1 += nums2
+        nums1.sort()
+        length = len(nums1)
+        value = length/2
+        if length % 2 == 0:
+            value = int(value)
+            return (nums1[value-1] + nums1[value])/2
+        else:
+            return nums1[int(value)]
 ```
 
 ### **Java**
@@ -75,6 +86,22 @@
 
 ```
 
+### **Nim**
+
+```nim
+proc medianOfTwoSortedArrays(nums1: seq[int], nums2: seq[int]): float =
+  var
+    fullList: seq[int] = concat(nums1, nums2)
+    value: int = fullList.len div 2
+
+  fullList.sort()
+
+  if fullList.len mod 2 == 0:
+    result = (fullList[value - 1] + fullList[value]) / 2
+  else:
+    result = fullList[value].toFloat()
+```
+
 ### **...**
 
 ```

solution/0000-0099/0004.Median of Two Sorted Arrays/Solution.nim

@@ -0,0 +1,21 @@
+import std/[algorithm, sequtils]
+
+proc medianOfTwoSortedArrays(nums1: seq[int], nums2: seq[int]): float =
+  var
+    fullList: seq[int] = concat(nums1, nums2)
+    value: int = fullList.len div 2
+
+  fullList.sort()
+
+  if fullList.len mod 2 == 0:
+    result = (fullList[value - 1] + fullList[value]) / 2
+  else:
+    result = fullList[value].toFloat()
+
+# Driver Code
+
+# var
+#   arrA: seq[int] = @[1, 2]
+#   arrB: seq[int] = @[3, 4, 5]
+# echo medianOfTwoSortedArrays(arrA, arrB)
+