概述 给定一个整数数组,返回两个数字的索引,使它们相加后得到特定的目标值。你 可以假设每个输入只有一个解决办法,并且你可能不会两次使用相同的元素。Example
题目来源于LeetCode,如下所示:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
JAVA 代码实现
package leetcode;
/**
* Given an array of integers, return indices of the two numbers such that they add up to a specific target.
* You may assume that each input would have exactly one solution, and you may not use the same element twice.
*/
public class TwoSum {
public static int[] twoSum(int[] nums, int target) {
int[] a = new int[2];
Boolean flag = false;
for(int i=0;i<nums.length;i++){
for(int j=i+1;j<nums.length;j++){
int sum = nums[i]+nums[j];
if(sum==target){
a[0] = i;
a[1] = j;
flag = true;
break;
}
}
if(flag){
break;
}
}
return a;
}
public static void main(String[] args) {
int[] nums = {2, 7, 11, 15};
System.out.println(twoSum(nums,9));
}
}
往
期
回
顾
JAVA并发编程:线程池ThreadPoolExecutor源码分析
JAVA并发编程:阻塞队列BlockingQueue之SynchronousQueue
JAVA并发编程:详解Executors工厂创建线程池的5种方法
JAVA并发编程:详解线程池ThreadPoolExecutor的基本应用
JAVA并发编程:详解线程池的工作原理
更多精彩内容请关注“菜鸟技术栈”微信公众号,一起交流学习,让学习成为一种享受!!!