leetcode 29: Merge Sorted Array

xudli

于 2013-01-11 07:28:42 发布

阅读量3.3k

点赞数 1

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/xudli/article/details/8492041

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文介绍了一种将两个已排序的整数数组A和B合并为一个排序数组A的算法实现。该算法采用双指针从后向前比较的方式，将较大的元素放入数组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 to hold additional elements from B. The number of elements initialized in A and B are m and n respectively.

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(n<1) return;
        
        int k = m+n-1;
        int i = m-1;
        int j = n-1;
        
        while( i>=0 && j>=0 ) {
            A[k--] = A[i] > B[j] ? A[i--] : B[j--];
        }
        
        while( j>=0 ) A[k--] = B[j--]; 
    }
};

public class Solution {
    public void merge(int A[], int m, int B[], int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        //input check 
        
        int i=m-1;
        int j=n-1;
        int k=m+n-1;
        
        while(i>=0 && j>=0) {
            A[k--] = A[i] > B[j] ? A[i--] : B[j--]; //!wrong!!! after ?, i,j value changed. A[i--] > B[j--] ? A[i] : B[j] 
        }
        
        while(j>=0) {
            A[k--] = B[j--];
        }
    }
}