Day4

[Day4]

1. Merge Sorted Array

문제 링크: https://leetcode.com/problems/merge-sorted-array/Merge Sorted Array

#include <iostream>

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        for(int i=m; i<nums1.size(); i++){
            nums1[i] = nums2[i-m];
        }
        sort(nums1.begin(), nums1.end());
    }
};

2. Container With Most Water

문제 링크: https://leetcode.com/problems/container-with-most-water/

#include <iostream>

class Solution {
public:
    int maxArea(vector<int>& height) {
        int result = 0;
        int left = 0;
        int right = height.size()-1;

        while(left < right){
            result = max(result,min(height[left], height[right])*(right-left));
            if(height[left]<height[right]) left++;
            else{
                right--;
            }
        }
        return result;
    }
};

3. Median of Two Sorted Arrays

문제 링크: https://leetcode.com/problems/median-of-two-sorted-arrays/

class Solution {
public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        nums1.insert(nums1.begin(), nums2.begin(), nums2.end());
        sort(nums1.begin(), nums1.end());
        if(nums1.size()%2==1){
            return nums1[nums1.size()/2];
        }
        else{
            return (nums1[nums1.size()/2]+nums1[nums1.size()/2-1])/2.0;
        }
    }
};