Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9
 
,
return [0, 1].

給定一個數組和一個目標，計算數組中任意兩個數的和，如果等於目標，則返回這兩個數字的下標

C#實現

public class Solution {
    public int[] TwoSum(int[] nums, int target) {
        int[] result = new int[2];
            for(int i = 0; i< nums.Length - 1; i++){
                for(int j = i+1; j < nums.Length; j++){
                    
 
if((nums[i] + nums[j]) == target){
                    result[0]= i;
                    result[1] = j;
                }
            }
        }
        return result;
    }
}

結束

LeetCode Array Easy 1. Two Sum