題目描述

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

解析：題目的設定很清楚了，只有一組，于是就容易了。

public class Solution {public int[] twoSum(int[] numbers, int target) {int [] result = new int[2];for(int i=0;i<numbers.length;i++){for(int j=i+1;j<numbers.length;j++){if((numbers[i]+numbers[j])==target){result[0]=i+1;//注意下標從1開始計數result[1]=j+1;break;}}}return result;} }

總結

以上是生活随笔為你收集整理的《leetcode》two-sum的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。