程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> 關於C++ >> LeetCode:Merge Sorted Array

LeetCode:Merge Sorted Array

編輯:關於C++

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.

// https://oj.leetcode.com/problems/merge-sorted-array/
// Author : Chao Zeng
// Date   : 2015-2-2

class Solution {
public:
    void merge(int A[], int m, int B[], int n) {
        int newlength = m + n - 1;
        int length1 = m - 1;
        int length2 = n - 1;
        //兩個數組末尾開始比較
        while(length1 >= 0 && length2 >= 0){
            if (A[length1] > B[length2]){
                A[newlength] = A[length1];
                length1--;
            }
            else{
                A[newlength] = B[length2];
                length2--;
            }
            newlength--;
        }
        //如果數組B比數組A長
        while(length2 >= 0){
            A[newlength] = B[length2];
            length2--;
            newlength--;
        }
    }
};
  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved