Commit51bbc48

applewjg

committed

MergeSortedArray

Change-Id: I47cac0a413ef4415ecc6c92d4ddadf96823ab782

1 parentd514441 commit51bbc48Copy full SHA for 51bbc48

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+/*`
	`2`	`+ Author: Andy, nkuwjg@gmail.com`
	`3`	`+ Date: Jan 7, 2015`
	`4`	`+ Problem: Merge Sorted Array`
	`5`	`+ Difficulty: Easy`
	`6`	`+ Source: https://oj.leetcode.com/problems/merge-sorted-array/`
	`7`	`+ Notes:`
	`8`	`+ Given two sorted integer arrays A and B, merge B into A as one sorted array.`
	`9`	`+ Note:`
	`10`	`+ You may assume that A has enough space to hold additional elements from B.`
	`11`	`+ The number of elements initialized in A and B are m and n respectively.`
	`12`	`+`
	`13`	`+ Solution: From back to forth.`
	`14`	`+ */`
	`15`	`+`
	`16`	`+publicclassSolution {`
	`17`	`+publicvoidmerge(intA[],intm,intB[],intn) {`
	`18`	`+inti =m -1;`
	`19`	`+intj =n -1;`
	`20`	`+intx =m +n -1;`
	`21`	`+while (i >=0 &&j >=0)`
	`22`	`+if (A[i] >=B[j])A[x--] =A[i--];`
	`23`	`+elseA[x--] =B[j--];`
	`24`	`+while (j >=0)A[x--] =B[j--];`
	`25`	`+ }`
	`26`	`+}`

Comments

(0)