Follow the pseudocode: Define one map to hold the result called res For index į in range 0 to n– 1 (where n is the number of elements in the array) if target – A[i] is present in res return res[target...

Python. Please use the method in the picture.

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].

Extracted text: Follow the pseudocode: Define one map to hold the result called res For index į in range 0 to n– 1 (where n is the number of elements in the array) if target – A[i] is present in res return res[target – A[i]] and i as indices Otherwise put i into the res as res[A[i]] – = i 1