/**
 * 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]
 * Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
 * Example 2:
 *
 * Input: nums = [3,2,4], target = 6
 * Output: [1,2]
 * Example 3:
 *
 * Input: nums = [3,3], target = 6
 * Output: [0,1]
 *
 * Main.kt run
 * println(
 * twoSumBest(
 * nums = intArrayOf(7, 5, 10, 2),
 * target = 12
 * ).contentToString()
 * )
 */

//My solution
fun twoSum(nums: IntArray, target: Int): IntArray {
    var result : IntArray = intArrayOf()
    nums.forEachIndexed { index, item ->
        val numberWeLook = target - item
        if(nums.contains(numberWeLook) && index != nums.indexOf(numberWeLook)) {
            result = intArrayOf(index, nums.indexOf(numberWeLook))
            return result
        }
    }
    return result
}

//Alternative solution
fun twoSumBest(nums: IntArray, target: Int): IntArray {
    val diffMap = mutableMapOf<Int, Int>()
    nums.forEachIndexed { index, int ->
        diffMap[int]?.let { return intArrayOf(it, index) }
        diffMap[target - int] = index
    }
    return intArrayOf()
}
