Careercup

2014-05-02 00:30

原题：

Given two arrays of sorted integers, merge them keeping in mind that there might be common elements in the arrays and that common elements must only appear once in the merged array.

题目：归并两个已排序的数组，重复元素只能在归并的结果里出现一次。

解法：题意很清晰，只是没有说两个数组里本身是否有重复元素，依题意写代码就可以了。

代码：

 1 // http://www.careercup.com/question?id=4713484755402752
 2 #include <vector>
 3 using namespace std;
 4 
 5 class Solution {
 6 public:
 7     void mergeSortedArray(vector<int> &a, vector<int> &b, vector<int> &c) {
 8         int na, nb;
 9         
10         na = (int)a.size();
11         nb = (int)b.size();
12         if (na == 0) {
13             c = b;
14             return;
15         } else if (nb == 0) {
16             c = a;
17             return;
18         }
19         
20         int i, j;
21         i = j = 0;
22         while (i < na && j < nb) {
23             if (a[i] < b[j])
24                 c.push_back(a[i++]);
25             } else if (a[i] > b[j]) {
26                 c.push_back(b[j++]);
27             } else {
28                 c.push_back((a[i++], b[j++]));
29             }
30         }
31         while (i < na) {
32             c.push_back(a[i++]);
33         }
34         while (j < nb) {
35             c.push_back(b[j++]);
36         }
37     }
38 };