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 = [, , , ], target = ,

Because nums[] + nums[] =  +  = ,
return [, ].

给定一个数组和一个目标，计算数组中任意两个数的和，如果等于目标，则返回这两个数字的下标

C#实现

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

结束