2020-08-14

剑指50：数组中重复的数组

import java.util.*;
public class Solution{
    public boolean duplicate(int numbers[],int length,int[] duplication){
        if(numbers == null || numbers.length<=0){
            duplicate[0] = -1;
            return false;
        }
        for(int i =0;i<numbers.length;i++){
            int index= numbers[i];
            if(inde>=numbers.length){
                index -= numbers.length;
            if(numbers[index]>= numbers.length){
                duplication[0]=index;
                return true;
            }
            numbers[index]+=numbers.length;
            }
            duplication[0] = -1;
            return false;
        }
    }
}

球1+2+3+。。。+n

public class Solution{
  
    public int Sum_Solution(int n){
        int ans = n;
        boolean ans = ((ans>0) && (ans += Sum_Solution(n-1))>0);
        return ans;
    }
}