Merge Sorted Array

最新推荐文章于 2022-03-29 18:08:48 发布

OracleDesire

最新推荐文章于 2022-03-29 18:08:48 发布

阅读量312

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/u013086906/article/details/17270847

版权

LeetCode 专栏收录该内容

111 篇文章 0 订阅

订阅专栏

传说中的归并排序么……

class Solution {
public:
	void merge(int A[], int m, int B[], int n) {
		int *C = new int[m + n];
		int ptr = 0;
		int i = 0, j = 0;
		while (i < m && j < n) {
			if (A[i] <= B[j]) {
				C[ptr++] = A[i++];
			}
			else {
				C[ptr++] = B[j++];
			}
		}
		if (i == m) {
			while (j < n)
				C[ptr++] = B[j++];
		}
		else if (j == n) {
			while (i < m)
				C[ptr++] = A[i++];
		}
		for (int i = 0; i < m + n; ++i)
			A[i] = C[i];
		delete C;
	}
};

http://oj.leetcode.com/problems/merge-sorted-array/