[03]-抖机灵

---

连续子向量最大和

public int MaxContinue(int []nums){
    int ans=0;
    int currMax=0;
    for(int i=0;i<nums.length;i++){
        currMax=Math.max(currMax+nums[i], 0);
        ans=Math.max(ans, currMax);
    }
    return ans;
}

---

整数倒置：细节

public int reverse(int n){
    if(n==Integer.MIN_VALUE){
        return 0;
    }
    if(n>=0){
        int ans=0;
        while(n!=0){
            if(ans>Integer.MAX_VALUE/10){
                return 0;
            }
            ans=ans*10+n%10;
            n=n/10;
        }
        return ans;
    }
    return -reverser(-n);
}