[leetcode] 1.Two Sum

目录汇总

1. Two Sum

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].

 

上一篇:AppCrawler 配置文件


下一篇:Leetcode-5214 Longest Arithmetic Subsequence of Given Difference(最长定差子序列)