TIL #71 : [Algorithm] LeetCode 1. Two sum

셀레스틴 허·2021년 2월 13일
0

ALGORITHM

목록 보기
10/18
post-thumbnail

Two sum

문제

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]
Output: 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]

풀이 코드:

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        length = len(nums)
        for i in range(length -1):
            for j in range(i+1, length):
                data = nums[i] + nums[j]
                if data == target:
                    return [i, j]
profile
Software Developer / 고통은 필연, 괴로움은 선택

0개의 댓글