1. Two Sum

https://leetcode.com/problems/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 :Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1]. 주어진 정수배열에서 더하여 특정값이 되는 두 숫자의 인덱스를 반환하라.각 입..
leetcode easy 2019. 2. 20. 00:56
1