leetcode编程题

66.加一

class Solution {
    public int[] plusOne(int[] digits) {
        int carry=1;
        for(int i=digits.length-1;i>=0;i--){
            int num=digits[i]+carry;
            digits[i]=num%10;
            carry=num/10;
            if(carry==0){
                break;
            }
        }
        if(carry==1){
            int[] arr=new int[digits.length+1];
            arr[0]=1;
            return arr;
        }
        return digits;
    }
}

169.多数元素

class Solution {
    public int majorityElement(int[] nums) {
        int m=nums[0];
        int count=1;
        for(int i=1;i<nums.length;i++){
            if(nums[i]==m){
                count++;
            }else{
                count--;
                if(count==0){
                    m=nums[i];
                    count=1;
                }
            }
        }
        return m;
    }
}

293.移动零

class Solution {
    public void moveZeroes(int[] nums) {

        int k=0;
        int temp=0;
        for(int i=0;i<nums.length;i++){
            if(nums[i]!=0){
                temp=nums[i];
                nums[i]=nums[k];
                nums[k]=temp;
                k++;
            }
        }
    }
}

674.最长连续递增序列

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        if(nums.length==0||nums.length==1){
            return nums.length; 
        }
        int maxCount=1;
        int count=1;
        for(int i=0;i<nums.length-1;i++){
            if(nums[i+1]>nums[i]){
                count++;
            }else{
                count=1;
            }
            maxCount=count>maxCount?count:maxCount;
        }
        return maxCount;
    }
}

1013.将数分成三个和相对的部分

class Solution {
    public boolean canThreePartsEqualSum(int[] A) {

        int sum=0;
        for(int num:A){
            sum+=num;
        }
        int key=sum/3;
        int group=0;
        for(int i=0;i<A.length;i++){
            key-=A[i];
            if(key==0){
                group++;
                key=sum/3;
            }
        }
        return group==3;
    }
}