1.题目及翻译
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].
给定一个整数数组，返回两个数字的索引，使它们加起来成为一个特定的目标。
您可能会认为每个输入都只有一个解决方案，而且您可能不会使用相同的元素两次。
2.思路
其实不算真的很明白题目的意思，只是凭借着自己的理解，写了种解法，效率不高。
3.解法
1）自己
public class Solution { public int[] TwoSum(int[] nums, int target) { int[] newIntArr = null; for (int i = 0; i < nums.Length; i++) { for (int j = 0; j < nums.Length; j++) { if ((i < j) && nums[i] + nums[j] == target) { newIntArr = new int[] { i, j }; } } } return newIntArr; } }