Careercup - Google面试题 - 6283958983589888

2014-05-06 11:31

题目链接

原题：

Find the k-th Smallest Element in Two Sorted Arrays. I followed the algorithm from this post, http://leetcode.com/2011/01/find-k-th-smallest-element-in-union-of.html
But it does not handle the case where there are duplicates? Does anyone know how to do that? Also, in Java, how should we reduce the size of the arrays? I used the code below, but did not work.

题目：给定长度为n和m的两个有序数组，找出两数组合并后第K小的数，即升序排第K位的数。

解法1：又是这位“Guy”老兄发的题目，连链接都给贴出来了，明摆着告诉别人这题是他从别处copy来的。不得不说，这道题是非常具有区分度的一道简单题/难题。简单的做法，自然是O(K)时间的算法，在归并过程中就可以得出第K小的元素。

代码：

 // http://www.careercup.com/question?id=6283958983589888
 #include <algorithm>
 #include <cstdio>
 #include <vector>
 using namespace std;

 int findKthSmallest(vector<int> &a, vector<int> &b, int k)
 {
     int na, nb;

     na = (int)a.size();
     nb = (int)b.size();
     if (na == ) {
         return b[k];
     } else if (nb == ) {
         return a[k];
     } else if (a[] > b[nb - ]) {
         return (k < nb ? b[k] : a[k - nb]);
     } else if (b[] > a[na - ]) {
         return (k < na ? a[k] : b[k - na]);
     }

     int i, j;

     i = j = ;
     int res = a[i] < b[j] ? a[i++] : b[j++];
     while (i + j <= k) {
         if (i == na) {
             res = b[j++];
         } else if (j == nb) {
             res = a[i++];
         } else {
             res = a[i] < b[j] ? a[i++] : b[j++];
         }
     }

     return res;
 }

 int main()
 {
     vector<int> a, b;
     int na, nb;
     int i;

     while (scanf("%d%d", &na, &nb) ==  && (na >  && nb > )) {
         a.resize(na);
         b.resize(nb);
         for (i = ; i < na; ++i) {
             scanf("%d", &a[i]);
         }
         for (i = ; i < nb; ++i) {
             scanf("%d", &b[i]);
         }
         while (scanf("%d", &i) == ) {
             printf("%d\n", findKthSmallest(a, b, i));
         }
         a.clear();
         b.clear();
     }

     return ;
 }

解法2：这个代码不是我独立写出的，在参考了这篇文章的思路以后，模仿写了一版代码。此算法的复杂度应该是O(log(k))的，文章中说是O(log(n) + log(m))。解法中有个比较关键的思想，i + j = k - 1。如果某个a[i]恰好夹在b[j - 1]和b[j]之间，那么a[i]一定排在归并结果的第i + j + 1位，也就是第k位(从1算起)。反过来b[j]夹在a[i - 1]和a[i]之间道理也是一样的。理解这个道理一开始让我费了一番功夫，理解代码里的各种条件表达式则是另一番功夫了。

代码：

 // http://www.careercup.com/question?id=6283958983589888
 #include <algorithm>
 #include <climits>
 #include <cstdio>
 #include <vector>
 using namespace std;

 int findKthSmallest(vector<int> &a, vector<int> &b, int na, int nb, int ia, int d, int k)
 {
     int ib = k -  - ia;

     int pre_a = ia ==  ? INT_MIN : a[ia - ];
     int pre_b = ib ==  ? INT_MIN : b[ib - ];
     int cur_a = ia == na ? INT_MAX : a[ia];
     int cur_b = ib == nb ? INT_MAX : b[ib];

     if (cur_a >= pre_b && cur_a <= cur_b) {
         return cur_a;
     }
     if (cur_b >= pre_a && cur_b <= cur_a) {
         return cur_b;
     }

     if (cur_a > cur_b) {
         ia = (k - ) - (ia - d) > nb ? (k - ) - nb : ia - d;
     } else {
         ia = ia + d > na ? na : ia + d;
     }

     return findKthSmallest(a, b, na, nb, ia, (d + ) / , k);
 }

 int main()
 {
     vector<int> a, b;
     int na, nb;
     int i;
     int ia;

     while (scanf("%d%d", &na, &nb) ==  && (na >  && nb > )) {
         a.resize(na);
         b.resize(nb);
         for (i = ; i < na; ++i) {
             scanf("%d", &a[i]);
         }
         for (i = ; i < nb; ++i) {
             scanf("%d", &b[i]);
         }
         while (scanf("%d", &i) == ) {
             ia = min(na, i - );
             printf("%d\n", findKthSmallest(a, b, na, nb, ia, (ia + ) / , i));
         }
         a.clear();
         b.clear();
     }

     return ;
 }