[LeetCode]1. Sum of two numbers thirty-four

Given an array of integers nums  And a target value target, Please find and as the target value in the array   Two   Integers , And return their array subscripts .

You can assume that each input corresponds to only one answer . however , The same element in an array cannot be used twice .

Example :

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

because nums[0] + nums[1] = 2 + 7 = 9
So back [0, 1]

source ： Power button （LeetCode）
link ：https://leetcode-cn.com/problems/two-sum
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

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

                int temp = target - nums[i];
                if (nums[j] == temp)
                {
    
                    return new int[2] {
     i, j };
                }
            }
        }

        return null;
    }
}