CareerCup 9.1

You are given two sorted arrays, A and B, and A has a large enough buffer at the end to hold B. Write a method to merge B into A in sorted order.

求指教啊.

1. void merge (int a[], int b[], int a_ele_num, int b_ele_num, int aSize)
   
2. {
   
3.         assert (aSize>=a_ele_num+b_ele_num);
   
4. 
   
5.         int ab_index = a_ele_num + b_ele_num - 1,
   
6.                 a_index = a_ele_num - 1,
   
7.                 b_index = b_ele_num - 1;
   
8. 
   
9.         for (int i=ab_index; i>=0; i--) {
   
10.                 if (a[a_index]>=b[b_index]) {
    
11.                         a[i] = a[a_index];
    
12.                         a_index -= 1;
    
13.                         ab_index -= 1;
    
14.                 } else {
    
15.                         a[i] = b[b_index];
    
16.                         b_index -= 1;
    
17.                         ab_index -= 1;
    
18.                 }
    
19.         }
    
20. 
    
21. }

复制代码

https://github.com/parker0203/careercup/blob/master/9_1.cpp

倒着比好像是个办法

利用A后的空间从后向前merge

285845348 发表于 2012-8-2 14:00
倒着比好像是个办法

超喜欢这个思想

和1.5的思想相似，就是利用已知预留的空间，倒着操作

https://github.com/writecoffee/c ... blob/master/9.1.cpp

https://gist.github.com/3739608