【LeetCode】1. 两数之和

https://leetcode-cn.com/problems/two-sum/

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

相同的思路，python也写一下

	class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        lens = len(nums)
        for i in range(0,lens):
            for j in range(i+1,lens):
                if (nums[i] + nums[j] == target):
                    return [i,j]