leetcode之Two Sum

码莎拉蒂 .

于 2015-10-29 16:53:39 发布

阅读量1.9k

点赞数

分类专栏：趣学算法文章标签： leetcode Two Sum

本文链接：https://blog.youkuaiyun.com/u011068702/article/details/49493759

版权

趣学算法专栏收录该内容

57 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍LeetCode中Two Sum问题的解决方案，函数需返回两个数的索引使得它们的和为目标值，且index1小于index2。给定示例：输入数组{2, 7, 11, 15}和目标值9，输出为index1=1, index2=2。" 114248390,10293179,易语言支持库大全 - 233个实用库合集,"['易语言开发', '编程支持库', 'Java编程', '数据库操作', '多媒体处理']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

中文理解：给你一个数组，和一个目标值，数组里面任意2个元素的值之和等于目标值，然后返回这2个元素的下标，下标从一开始，不是0开始，上面的结果index1=1,index2=2就知道了

public class Solution {
    public int[] twoSum(int[] nums, int target) {
            int index1=0;
            int index2=1;
            for(int i=0;