[LeetCode] Two Sum

https://leetcode.com/problems/valid-parentheses/submissions/

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
 
Example 1:
Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6 Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6 Output: [0,1]
 
Constraints:
2 <= nums.length <= 104-109 <= nums[i] <= 109-109 <= target <= 109Only one valid answer exists.

두 숫자를 더해서 target의 숫자와 일치하면 index를 반환하는 문제입니다. 저는 완전 탐색을 이용했습니다.

아래는 소스 코드 입니다.

 

class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] answer = new int[2];

        for (int i = 0; i < nums.length; i++) {
            int a = nums[i];
            int b = nums[nums.length - i - 1];

            if (a + b == target) {
                answer[0] = i;
                answer[1] = nums.length - i - 1;
                break;
            }
        }

        return answer;
    }
}​