1. Two Sum - brute-force with C

1. Two Sum 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. > Integer list를 받아 두 수의 합으로 target을 만들 수 있는지 확인하는 문제이다. Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1..