<commit_before><commit_msg>add leetcode Merge Sorted Arra<commit_after># -*- coding:utf-8 -*-
class Solution:
    # @param A  a list of integers
    # @param m  an integer, length of A
    # @param B  a list of integers
    # @param n  an integer, length of B
    # @return nothing
    def merge(self, A, m, B, n):
        la = m - 1
        lb = n - 1
        index = m + n - 1
        while la >= 0 and lb >= 0:
            if A[la] > B[lb]:
                A[index] = A[la]
                la -= 1
            else:
                A[index] = B[lb]
                lb -= 1
            index -= 1
        while lb >= 0:
            A[index] = B[lb]
            lb -= 1
            index -= 1
{'fraction_non_alphanumeric': 0.11832611832611832, 'fraction_numerical': 0.017316017316017316, 'mean_word_length': 1.1419753086419753, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5270256', 'n_tokens_mistral': 238, 'n_tokens_neox': 220, 'n_words': 81}