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 andn respectively.

    思路:从后往前复制,注意两个数组都为空或者其中一个数组为空的情况。

       时间复杂度O(n),空间复杂度O(1)

     1 class Solution {
     2 public:
     3     void merge(int A[], int m, int B[], int n) {
     4         if (n == 0)
     5             return;
     6         int index = m + n - 1;
     7         int ia = m - 1;
     8         int ib = n - 1;
     9         while (ia >=0 && ib >= 0) {
    10             A[index--] = A[ia] >= B[ib] ? A[ia--] : B[ib--];
    11         }
    12         while (ib >= 0) {
    13             A[index--] = B[ib--];
    14         }
    15     }
    16 };
  • 相关阅读:
    Quagga How to use Quagga
    Quagga Case 4
    Quagga Case 3
    Quagga Case 2
    Quagga Routing Suite
    quagga
    quagga 的原理解析 zebra原理解析
    zebra线程管理源码简析
    【习题 4-8 UVA
    【习题 4-7 UVA
  • 原文地址:https://www.cnblogs.com/vincently/p/4121008.html
Copyright © 2011-2022 走看看