利用 %20 替换 空格

void ArrayMerage(vector<int>& Vector1, vector<int>& Vector2)
{
int index_1_before = Vector1.size() - 1, index_2 = Vector2.size() - 1;
int sum = Vector1.size() + Vector2.size();
int index_1_behind = sum - 1;
Vector1.resize(sum);
while (index_2 >= 0 && index_1_before >= 0)

Vector1[index_1_behind--] = Vector1[index_1_before] > Vector2[index_2] ? \
Vector1[index_1_before--] : Vector2[index_2--];
while (index_2 >= 0)
Vector1[index_1_behind--] = Vector2[index_2--];
}