LeetCode Prob.1 Two sum

1 · Bowen Tan · July 13, 2022, 7:58 a.m.
Problem statement Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. Assume that there is exactly one solution, and that each integer can be used only once. The answer may be returned in any order. Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9, [0, 1] is returned. Example 2: Input: nums = [3,2,4], target = 6 Output: [1,2] Example 3: Input: nums = [3,3], target = 6...