[Daily LeetCode]——1. The sum of two numbers

Table of Contents

Original title: Sum of two numbers

SolutionQuestion ideas:

Summary:

---

OriginalQuestion: Sum of two numbers

Given an integer array nums and an integer target value target, please find the two integers whose and is the target value target in the array, and return their array indices.

You can assume that there will only be one answer per input.However, the same element in the array cannot be repeated in the answer.

You can return answers in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9Output: [0,1]Explanation: Because nums[0] + nums[1] == 9 , return [0, 1] .

Example 2:

Input: nums = [3,2,4], target = 6Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6Output: [0,1]

Solution ideas:

Start from the first element of the array. Since we want to compare the sum of the two numbers and the target number is equal, we need to use a loop to compare each number after the number to see if the sum is equal toThe target number, returns its subscript if they are equal, or returns no subscript if not.

Code implementation:

class Solution {public int[] twoSum(int[] nums, int target) {int length=nums.length;for(int i=0;i

Execution result:

Summary:

Brush every day, don't slack off!!!