Commit fe5b080

author

Openset

committed

Add: Merge Sorted Array

1 parent c335184 commit fe5b080Copy full SHA for fe5b080

File tree

+58

-0

lines changed

+58

-0

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,14 @@`
`1`	`1`	`package merge_sorted_array`
	`2`	`+`
	`3`	`+func merge(nums1 []int, m int, nums2 []int, n int) {`
	`4`	`+ copy(nums1[n:], nums1)`
	`5`	`+ cur, i, j := 0, n, 0`
	`6`	`+ for j < n {`
	`7`	`+ if i < m+n && nums1[i] < nums2[j] {`
	`8`	`+ nums1[cur], i = nums1[i], i+1`
	`9`	`+ } else {`
	`10`	`+ nums1[cur], j = nums2[j], j+1`
	`11`	`+ }`
	`12`	`+ cur++`
	`13`	`+ }`
	`14`	`+}`

Lines changed: 45 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,46 @@`
`1`	`1`	`package merge_sorted_array`
	`2`	`+`
	`3`	`+import (`
	`4`	`+ "reflect"`
	`5`	`+ "testing"`
	`6`	`+)`
	`7`	`+`
	`8`	`+type caseType struct {`
	`9`	`+ nums1 []int`
	`10`	`+ m int`
	`11`	`+ nums2 []int`
	`12`	`+ n int`
	`13`	`+ expected []int`
	`14`	`+}`
	`15`	`+`
	`16`	`+func TestMerge(t *testing.T) {`
	`17`	`+ tests := [...]caseType{`
	`18`	`+ {`
	`19`	`+ nums1: []int{1, 2, 3, 0, 0, 0},`
	`20`	`+ m: 3,`
	`21`	`+ nums2: []int{2, 5, 6},`
	`22`	`+ n: 3,`
	`23`	`+ expected: []int{1, 2, 2, 3, 5, 6},`
	`24`	`+ },`
	`25`	`+ {`
	`26`	`+ nums1: []int{-9, -6, -3, 0, 0, 0},`
	`27`	`+ m: 3,`
	`28`	`+ nums2: []int{-7, -5, -3},`
	`29`	`+ n: 3,`
	`30`	`+ expected: []int{-9, -7, -6, -5, -3, -3},`
	`31`	`+ },`
	`32`	`+ {`
	`33`	`+ nums1: []int{1, 2, 4, 5, 6, 0},`
	`34`	`+ m: 5,`
	`35`	`+ nums2: []int{3},`
	`36`	`+ n: 1,`
	`37`	`+ expected: []int{1, 2, 3, 4, 5, 6},`
	`38`	`+ },`
	`39`	`+ }`
	`40`	`+ for _, tc := range tests {`
	`41`	`+ merge(tc.nums1, tc.m, tc.nums2, tc.n)`
	`42`	`+ if !reflect.DeepEqual(tc.nums1, tc.expected) {`
	`43`	`+ t.Fatalf("input: %v %v %v %v, output: %v, expected: %v", tc.nums1, tc.m, tc.nums2, tc.n, tc.nums1, tc.expected)`
	`44`	`+ }`
	`45`	`+ }`
	`46`	`+}`

Comments

(0)