package leetcode; import java.util.Arrays; 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 = i + 1; j < nums.length; j++) { if (nums[i] + nums[j] == target) { result[0] = i; result[1] = j; } } } return result; } } public class twoNumberNum { public static void main(String[] args) { Solution solution = new Solution(); System.out.println(Arrays.toString(solution.twoSum(new int[]{2, 7, 11, 15}, 9))); } }
力扣两数之和java
于 2024-07-13 16:30:17 首次发布