[leetcode]29 Merge Sorted Array

题目链接：https://leetcode.com/problems/merge-sorted-array/
Runtimes：7ms

1、问题

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.

2、分析

将B中的元素插入排序的方法插入到A中。

3、总结

一些边界值的判断好繁琐。敲代码要注意一下。

4、实现

class Solution {public:    void merge(int A[], int m, int B[], int n) {        if(0 == n)            return;        if(0 == m)        {            int i = 0;            while(i < n)            {                A[i] = B[i];                i++;            }            return;        }        int i1 = 0, i2 = 0;        while(true)        {            while(i1 < m && i2 < n && A[i1] <= B[i2]) ++i1;            if(i1 >= m || i2 >= n)                break;            for(int i = m - 1; i >= i1; i--)            {                A[i + 1] = A[i];            }            A[i1] = B[i2];            i2++;            i1++;            m += 1;        }        while(i2 < n)        {              A[i1] = B[i2];              i1++;i2++;        }        return ;    }};

5、反思

简单的题目，不要花太久。