拓展:a1,b1是已经排完大小元素的数组,把a1和b1高效的合成一个数组
#include<stdio.h>void fun(int a[],int len1,int b[],int len2){ int len = len1+len2; len--; len1--; len2--; while(len1>=0 && len2>=0){ if(a[len1]>=b[len2]){ a[len--] = a[len1--]; }else{ a[len--] = b[len2--]; } } //如果len2有剩余的话,则把剩余的元素移动到a while (len2>=0) { a[len--] = b[len2--]; } //len1剩余,证明已经排好}int main(){ int a[10] = {2,3,4,311}; int b[6] = {}; int len1 = 4; int len2 = 0; fun(a,len1,b,len2); for (int i=0;i<len1+len2;i++) { printf("%d ",a[i]); }新闻热点
疑难解答