class Solution:

    def solve(self, a, b):
        c = []
        i, j = 0, 0
        while i < len(a) and j < len(b):
            if a[i] < b[j]:
                c.append(a[i])
                i += 1
            else:
                c.append(b[j])
                j += 1
        return c + a[i:] + b[j:]

991511ce58940c3cb381ac5216f09cd975b7a00d
<mask token>

class Solution:
    <mask token>

class Solution:

    def solve(self, a, b):
        c = []
        i, j = 0, 0
        while i < len(a) and j < len(b):
            if a[i] < b[j]:
                c.append(a[i])
                i += 1
            else:
                c.append(b[j])
                j += 1
        return c + a[i:] + b[j:]
