int?z?=?i;
while(z?<?k?+?1)?{
if(x?==?j?-?i?+?1)?pA[z++]?=?pR[y++];
if(y?==?k?-?j)?pA[z++]?=?pL[x++];
if(pL[x]?<?pR[y])?pA[z++]?=?pL[x++];
else?pA[z++]?=?pR[y++];//?可能造成索引越界
}簡單修改如下:
x?=?0;?y?=?0;
int?z?=?i;
while(z?<?k?+?1)?{
if(x?==?j?-?i?+?1)?pA[z++]?=?pR[y++];
else?if(y?==?k?-?j)?pA[z++]?=?pL[x++];
else?if(pL[x]?<?pR[y])?pA[z++]?=?pL[x++];
else?pA[z++]?=?pR[y++];
}