[LeetCode]--1. Two Sum

杜鲁门

于 2016-09-26 22:52:51 发布

阅读量641

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode算法分析文章标签： leetcode 刷题算法 LeetCoder 两个数的和

本文链接：https://blog.youkuaiyun.com/bug_moving/article/details/52675376

115 篇文章 ¥9.90 ¥99.00

订阅专栏

126 篇文章

订阅专栏

该博客介绍了如何解决LeetCode上的1. Two Sum问题，即给定一个整数数组和一个目标值，找出数组中和为目标值的两个整数的索引。

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

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.

Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int result[] = new int

了解本专栏