【LeetCode】解析_1. Two Sum

1. Two Sum(Easy)

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.

問題及參考網站取自 Leetcode.

...繼續閱讀 »