1. Two Sum Easy 6 27688 O Add to List O Share 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...

Please complete the following code in C++ with an explanation. Thanks in advance.

Extracted text: 1. Two Sum Easy 6 27688 O Add to List O Share 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: Inputi nums = [2,7,11,15], target = 9 Outputi [8,1] Outputi Because nums [0] + nums [1] == 9, we return [e, 1). Example 2: Inputi nums = [3,2,4], target = 6 Outputi [1,2] Example 3: Inputi nums = [3,3], target = 6 Outputi (8,1] Constraints: • 2 = nums.length < 104="" •="" -10°="nums" [i]=""><= 10="" •="" -10°="target" =="" 10="" •="" only="" one="" valid="" answer="">


Extracted text: i C++ • Autocomplete class Solution { public: vectorcint> twosum(vectorcint>& nums, int target) { 1. 2 4 } }; Console - Contribute i