LeetCodeTop100

哎呀 我怎么在刷算法 刷吧

Easy

Day1:两数之和

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int length=nums.length;//length function
        for(int i=0;i<length;i++){
            for(int j=i+1;j<length;j++){
                if(nums[i]+nums[j]==target){
                    return new int[]{i,j};//new a array to return
                }
            }
        }
        return new int[]{}; //must have return
    }
}

Medium

Hard