leetcode

Leetcode submissions
git clone git://git.laack.co/leetcode.git
Log | Files | Refs | README

median-of-sorted-array.cpp (799B)

      1 #include <iostream>
      2 #include <vector>
      3 #include <algorithm>
      4 
      5 //Leet Ratings
      6 //       Speed  Memory
      7 //Total  27ms    89.8MB    
      8 //Beats  97.24%  42.65%
      9 //
     10 
     11 
     12 using namespace std;
     13 
     14 double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
     15 
     16     for(int i = 0; i < nums2.size() ; ++i){
     17         nums1.push_back(nums2[i]);
     18     }
     19     sort(nums1.begin(), nums1.end());
     20     
     21     double median;
     22     if(nums1.size() % 2 == 0){
     23         int middle = (nums1.size() / 2) - 1;
     24         median = double((nums1[middle] + nums1[middle + 1])) / 2;
     25     }
     26     else{
     27         median = nums1[nums1.size() / 2];
     28     }
     29     return median;
     30 }
     31 
     32 
     33 
     34 
     35 int main(){
     36 
     37     vector <int> first = {0, 10, 15, 20, 25};
     38     vector <int> second = {0 , 23, 29, 30, 50};
     39     cout << findMedianSortedArrays(first, second) << endl;
     40 
     41 
     42 
     43 }