Leetcode1 - 10

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> v;
        for(int i = 0;i < nums.size();i++){
            for(int j = i;j < nums.size();j++){
                if(i != j && nums[i] + nums[j] == target){
                    v.push_back(i);
                    v.push_back(j);
                }
            }
        }
        return v;
    }
};

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

class Solution {
public:

    typedef long long ll;

    int count(ll x){
        int count = 0;
        while(x){
            x /= 10;
            count++;
        }
        return count;
    }

    int reverse(int x) {
        ll ans = 0;
        int len = count(x);
        while(x){
            ans += (x % 10) * pow(10,count(x) - 1);
            x /= 10;
            len--;
        }

        if(ans > INT_MAX || ans < INT_MIN)
            return 0; 
        return (int)ans;
    }
};

class Solution {
public:
bool isPalindrome(int x) {
    
    if(x < 0)
        return false;
    
    vector<char> v;
    while(x){
        v.push_back(x % 10);
        x /= 10;
    }
    for(int i = 0,j = v.size() - 1;i < v.size();i++,j--){
        if(v[i] != v[j])
            return false;
    }

    return true;
}
};