LeetCode Array Easy 1. Two Sum

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;
    }
}

结束