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:
　　　　1.Given nums = [2, 7, 11, 15], target = 9,
　　　　2.Because nums[0] + nums[1] = 2 + 7 = 9,
　　　　3.return [0, 1].

給一個型態為INT的陣列，其中有2個元素相加為target，回傳這兩個元素的位址。

public class Solution {
    int[] Result=new int[2];
    public int[] twoSum(int[] nums, int target) {
        for(int i=0;i<nums.length;i++){
            for(int z=i+1;z<nums.length;z++){
                if(nums[i]+nums[z]==target){
                   Result[0]=i;
                   Result[1]=z;
                }
            }
        }
        return Result;
    }
}