r0ysue肉丝unidbg原理与实操
while (first < left.length && second < right.length) {
if (left[first] < right[second]) {
nums[index++] = left[first++];
} else {
nums[index++] = right[second++];
}
}
// remaining
while (first < left.length) {
nums[index++] = left[first++];
}
while (second < right.length) {
nums[index++] = right[second++];
}
}}
