LeetCode Merge Sorted Array(直接插入排序)

原创于 2014-11-08 22:07:04 发布 · 582 阅读

0 ·

CC 4.0 BY-SA版权

OJ 专栏收录该内容

986 篇文章

订阅专栏

本文介绍了一种合并两个已排序整数数组的算法实现。通过直接插入排序法将两个数组合并为一个排序数组。该方法简单易懂，适用于初学者学习排序算法。

摘要生成于 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 m andn respectively.

题意：给出两个排好序的数组，将它们合并成一个排序的数组

思路：用直接插入排序法

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