LeetCode #1 Two Sum
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.
Ex 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Ex 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Ex 3:
Input: nums = [3,3], target = 6
Output: [0,1]
Constraints
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
Input: nums = [3,2,4], target = 6
Output: [1,2]
Input: nums = [3,3], target = 6
Output: [0,1]
Java Code
class Solution {
public static 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;
}
}
説明する
target
と比較します.Reference
この問題について(LeetCode #1 Two Sum), 我々は、より多くの情報をここで見つけました https://velog.io/@nathan29849/LeetCode-1-Two-Sumテキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol