Two Sum LeetCode OJ
来源:互联网 发布:新疆人 知乎 编辑:程序博客网 时间:2024/04/30 01:36
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
Subscribe
public class Solution {
public int[] twoSum(int[] nums, int target) {int[] index=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){
if(i<=j){
index[0]=i+1;
index[1]=j+1;
}else
{
index[0]=j+1;
index[1]=i+1;
}
}
}
}
return index;
}
}
0 0
- LeetCode OJ:Two Sum
- LeetCode OJ : two sum
- LeetCode OJ -Two Sum
- LeetCode OJ Two Sum
- [LeetCode OJ] Two Sum
- Two Sum LeetCode OJ
- LeetCode OJ - Two Sum
- LeetCode OJ ----Two Sum
- LeetCode OJ--Two Sum
- Two Sum (LeetCode OJ)
- LeetCode OJ:Two sum
- [LeetCode OJ][001]Two Sum
- 【LeetCode OJ 001】Two Sum
- LeetCode OJ 1Two Sum
- LeetCode OJ 01 Two Sum
- LeetCode OJ : 1 Two Sum
- LeetCode OJ 1. Two Sum
- LeetCode OJ 1. Two Sum
- Dalvik switch语句
- karma requirejs 加载问题小记
- PHP中final类,抽象类,接口结构
- 编写高质量iOS 与OSX 代码的52个有效方法之系统框架
- Android RecyclerView使用详解四
- Two Sum LeetCode OJ
- poj 3281 网络流最大流量
- 专题:如何写测试——Spark
- Null & nil & Nil & NSNull
- XML应用于处理
- pydev的注释快捷键
- centos7 yum install nginx
- 工作流
- 小心使用ArrayList和LinkedList