当前位置

网站首页> 程序设计 > 开源项目 > 程序开发 > 浏览文章

Leetcode-Two Sum

作者:小梦 来源: 网络 时间: 2024-07-22 阅读:

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[] nums, int target) {        int[] result = new int[2];        int i, j;        for (i = 0; i < nums.length; i++) {for (j = i + 1; j < nums.length; j++) {    if (nums[i] + nums[j] == target) {        result[0] = i+1;        result[1] = j+1;    }}        }        return result;    }}

热点阅读

网友最爱