首页 > 代码库 > leetcode第一题
leetcode第一题
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].
public class Solution { public int[] twoSum(int[] nums, int target) { if(nums.length<2) return nums; int[] arr=new int[2]; Map<Integer,Integer> map=new HashMap<Integer,Integer>(); for(int i=0;i<nums.length;i++) { if(!map.containsKey(nums[i])){ map.put(nums[i],i); } if(map.containsKey(target-nums[i])&&i!=map.get(target-nums[i])) { arr[0]=map.get(target-nums[i]); arr[1]=i; return arr; } } return arr; } }
如果有更好解法的朋友欢迎评论。
leetcode第一题
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。