woose/LeetCode-1.Two_Sum_via_CPP
Template
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

README.md Güncelle

Browse Source
This commit is contained in:
Yavuz Sava 2025-03-28 20:05:21 +00:00
parent eacdfb4d35
commit d25d777409
1 changed files with 7 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
README.md
View File

@ -7,19 +7,26 @@ You can return the answer in any order.
## Example 1: ## Example 1:
Input: nums = [2,7,11,15], target = 9 Input: nums = [2,7,11,15], target = 9
Output: [0,1] Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]. Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
## Example 2: ## Example 2:
Input: nums = [3,2,4], target = 6 Input: nums = [3,2,4], target = 6
Output: [1,2] Output: [1,2]
## Example 3: ## Example 3:
Input: nums = [3,3], target = 6 Input: nums = [3,3], target = 6
Output: [0,1] Output: [0,1]
## Constraints: ## Constraints:
2 <= nums.length <= 104 2 <= nums.length <= 104
-109 <= nums[i] <= 109 -109 <= nums[i] <= 109
-109 <= target <= 109 -109 <= target <= 109
Only one valid answer exists. Only one valid answer exists.