LEETCODE: Merge Sorted Array

停止更新+1

于 2014-12-27 15:42:27 发布

阅读量263

点赞数

CC 4.0 BY-SA版权

文章标签： LEETCODE 算法数组

本文链接：https://blog.youkuaiyun.com/anyicheng2015/article/details/42193455

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一种将两个已排序的整数数组B合并到数组A中并保持排序的方法。该算法通过遍历数组B并将每个元素插入到数组A的适当位置来实现。详细展示了如何调整数组A的空间以容纳额外的元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are mand n respectively.

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        for(int ii = 0; ii < n; ii ++) {
            int pos = 0;
            while(pos < m && A[pos] < B[ii]) {
                pos ++;
            }
            for(int jj = m; jj > pos; jj --) {
                A[jj] = A[jj - 1];
            }
            A[pos] = B[ii];
            m ++;
        }
    }
};