leetcode.jp 博客
本网站所有文字及图片内容均来自网络,每周定时更新,仅供个人学习与研究,请勿用于商业用途。谢谢合作。

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

Difficulty:

Easy

Lock:

Normal

Company:

Adobe Aetion Affirm Airbnb Alibaba Amazon Apple Audible Baidu BlackRock Bloomberg Booking.com Box ByteDance Cisco Citadel Citrix Deutsche Bank DiDi Drawbridge Dropbox eBay EMC Expedia Facebook FactSet GE Digital GoDaddy Goldman Sachs Google Groupon Huawei IBM Indeed Intel Intuit JPMorgan LinkedIn Lyft MAQ Software Mathworks Microsoft Morgan Stanley NetEase Nvidia Oracle Paypal Qualcomm Quora Radius Roblox Salesforce Samsung SAP ServiceNow Snapchat Splunk Spotify Tableau Tencent Twilio Twitter Two Sigma Uber Valve Visa VMware Walmart Labs Wayfair Wish Works Applications Yahoo Yandex Yelp Zillow Zoho