merge_sorted_array

Author: hitzzc

README.md

@@ -76,6 +76,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [84. largest rectangle in histogram](https://github.com/hitzzc/go-leetcode/tree/master/largest_rectangle_in_histogram)
 #### [85. maximal rectangle](https://github.com/hitzzc/go-leetcode/tree/master/maximal_rectangle)
 #### [86. partition list](https://github.com/hitzzc/go-leetcode/tree/master/partition_list)
+#### [88. merge sorted array](https://github.com/hitzzc/go-leetcode/tree/master/merge_sorted_array)
 
 
 

merge_sorted_array/merge_sorted_array.go

@@ -0,0 +1,19 @@
+package merge_sorted_array
+
+func merge(nums1 []int, m int, nums2 []int, n int) {
+	for i := m + n - 1; m > 0 && n > 0 && i >= 0; i-- {
+		if nums1[m-1] > nums2[n-1] {
+			nums1[i] = nums1[m-1]
+			m--
+		} else {
+			nums1[i] = nums2[n-1]
+			n--
+		}
+	}
+	if m == 0 {
+		for ; n > 0; n-- {
+			nums1[n-1] = nums2[n-1]
+		}
+	}
+	return
+}