Sunbelt Computer Software

PL/B Language Development and Support

Home
About
Blog
Products
Forum
Support
Contact

leetcode-2/Merge_Sorted_Array.cc at master · zwxalgorithm/leetcode-2 · GitHub

14 lines (14 loc) · 402 Bytes

class Solution {
    void merge(int A[], int m, int B[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int cur = m + n - 1;
        m--, n--;
        while (m >= 0 && n >= 0) {
            if (A[m] > B[n])    A[cur--] = A[m--];
            else    A[cur--] = B[n--];
        while (n >= 0)  A[cur--] = B[n--];

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

Merge_Sorted_Array.cc

Latest commit

History

Merge_Sorted_Array.cc

File metadata and controls