心得：
滿基本的一題，只是我的方法有點爛XD
題目：
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.
答案：
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
public class Solution { public int[] TwoSum(int[] nums, int target) { for(int i = 0; i < nums.Length; i++){ for(int j = i + 1 ; j < nums.Length; j++){ if(nums[i] + nums[j] == target){ return new int[]{i, j}; } } } throw new Exception("error"); } } |
