LeetCode1. Two numbers (JAVA realization)

topic:

Code:

class Solution {
    public int[] twoSum(int[] nums, int target) {
        if (nums == null || nums.length <= 1) {
        return null;
        }
    
        
        for(int i=0;i<nums.length;i++){
            for(int j=i+1;j<nums.length;j++){
                if(nums[i]+nums[j]==target){
                    return new int[] {i,j};
                
                }
            }
        }
        return null;
        
    }   
}

 

Published 31 original articles · won praise 1 · views 1254

Guess you like

Origin blog.csdn.net/qq_45824565/article/details/104593127