zoukankan      html  css  js  c++  java
  • LeetCode:Merge Sorted Array

         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 and n respectively.


    解题思路:

        因为题目已经说明A中已有足够的空间容纳B中的元素,所以从A的尾端開始放置元素就可以.


    解题代码:

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

    A[i--] : B[j--] ; while (i >= 0) A[pos--] = A[i--] ; while (j >= 0) A[pos--] = B[j--] ; } };



  • 相关阅读:
    DOM
    JS方法
    边界与边框,列表与方块
    for 练习
    背景与前景温习
    AD域账号验证
    邮件发送案例
    获取每个月最后一天的小技巧
    SQL 执行顺序
    常用下载地址
  • 原文地址:https://www.cnblogs.com/mqxnongmin/p/10567238.html
Copyright © 2011-2022 走看看