leetcode/MergeSortedArray.java at master · mengli/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/**
 * Given two sorted integer arrays A and B, merge B into A as one sorted array.
 *
 * <p>Note:
 *
 * <p>You may assume that A has enough space to hold additional elements from B. The number of
 * elements initialized in A and B are m and n respectively.
 */
publicclassMergeSortedArray {
publicvoidmerge(intA[], intm, intB[], intn) {
inti = m - 1, j = n - 1;
intk = m + n - 1;
while (i >= 0 && j >= 0) {
A[k--] = A[i] >= B[j] ? A[i--] : B[j--];
 }
while (j >= 0) {
A[k--] = B[j--];
 }
 }
}