https://leetcode.com/problems/two-sum/
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] result = new int[2];
for(int i = 0; i < nums.length; i++)
{
for(int j = 0; j < nums.length; j++)
{
if(i != j)
{
if(nums[i] + nums[j] == target)
{
System.out.println("nums[i] = " + nums[i]);
System.out.println("nums[j] = " + nums[j]);
result[0] = i;
result[1] = j;
return result;
}
}
}
}
return null;
}
}
'ALGORITHM > 릿코드' 카테고리의 다른 글
LeetCode 21. Merge Two Sorted Lists (1) | 2024.01.04 |
---|---|
LeetCode 234 Palindrome Linked List (1) | 2024.01.04 |
383. Ransom Note (0) | 2023.11.03 |
102. Binary Tree Level Order Traversal (0) | 2023.11.02 |
169. Majority Element (0) | 2023.11.02 |