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 exactlyvone solution, and you may not use the same element twice.
You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).