JAVA_Two Sum_LeetCode 1

JAVA_Two Sum_LeetCode 1 Two Sum 풀이 class Solution { public int[] twoSum(int[] nums, int target) { for(int i=0; i< nums.length; i++){ for(int j = i+1; j< nums.length; j++){ if(nums[i] + nums[j] == target){ return new int[]{i,j}; } }; }; return null; } } * 출처 Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com...

원문링크 : JAVA_Two Sum_LeetCode 1