每日三题day1：LeetCode

每日三题day1：LeetCode

1.两数之和

9.回文数

7. 整数反转

---

1、1.两数之和

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

2、9.回文数

class Solution {
public:
    bool isPalindrome(int x) {
        bool ok = true;
        if(x < 0) ok = false;
        else if(x == 0) ok = true;
        else{
            string s = to_string(x);
            for(int i = 0; i < s.size() / 2; i++){
                if(s[i] != s[s.size() - 1 - i]){
                    ok = false; break;
                }
            }
        }
        return ok;
    }
};

3、7. 整数反转

class Solution {
public:
    int reverse(int x) {
        long STD = (long)1 << 31;
        long ans = 0;
        while(x){
            ans = ans * 10 + x % 10;
            x /= 10;
        }
        if(ans < -STD || ans > STD - 1) ans = 0;
        return (int)ans;
    }
};

---

2021/7/11完(感觉有一个世纪没有刷题了，刷刷题找找感觉吧)。