How to write code for the sum of two numbers

This article introduces the relevant knowledge of "how to write the code of the sum of two numbers". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

The sum of two numbers

Given an array of integers nums and an integer target value target, please find the two integers in the array that are the target values and return their array subscript.

You can assume that each input corresponds to only one answer. However, the same element in the array cannot be repeated in the answer.

You can return the answers in any order. Link: https://leetcode-cn.com/problems/two-sum

Using HashMap to establish Kmuri V relationship, it is convenient to quickly determine the subscript when finding a suitable number, map.put (nums [I], I)

Just use map.containsKey (num) to find out whether there is a difference of satisfaction, int num = target-nums [I]

If there is, it is [iMap.get (num)], if not, add the value to map [map.put (nums [I], I)]

Class Solution {public int [] twoSum (int [] nums, int target) {int [] res = new int [2]; int len = nums.length; Map map = new HashMap ()