LeetCode ---2.Two Sum
来源:互联网 发布:订货会系统源码 编辑:程序博客网 时间:2024/06/05 03:08
题目
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, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0, 1].
网址来源:https://leetcode.com/problems/two-sum/#/description
public int[] twoSum(int[] nums, int target) { for (int i = 0; i < nums.length; i++) { for (int j = i + 1; j < nums.length; j++) { if (nums[i] + nums[j] == target) { return new int[]{i, j}; } } } throw new IllegalArgumentException("No solution"); }
解题思路:通过2层循环来找出某2个值的和是否等于target的值,若相等则返回该2个值的索引下标,关键点在于第二层循环的j=i+1,减少遍历的重复以及降低时间复杂度
阅读全文
0 0
- LeetCode ---2.Two Sum
- LeetCode---2.Two Sum
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- 音视频直播--Android视频采集(Camera2)
- 基于redis+mysql+php的简单队列实现
- Unity_PlayerPrefs_022
- java Timer为什么是线程安全的
- 从程序员到项目经理:思维一换天地宽
- LeetCode ---2.Two Sum
- Unity_2D系统_023
- String、StringBuffer和StringBuilder的区别
- ACM 递归 non-boring sequences
- android进程保活
- Lintcode92 Backpack solution 题解
- 《美团点评》编程题---有一个二维数组(n*n),写程序实现从右上角到左下角沿主对角线方向打印
- Groovy语言简介及基本语法
- openjudge 海贼王之伟大航路 状态压缩dp