Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit b263e11

Browse files
Format description
1 parent 505d9c6 commit b263e11

File tree

1 file changed

+4
-2
lines changed

1 file changed

+4
-2
lines changed

‎lib/src/easy/1.two_sum/problem.txt‎

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,10 @@
11
1. Two Sum
22
https://leetcode.com/problems/two-sum/
33

4-
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
5-
You may assume that each input would have exactly one solution, and you may not use the same element twice.
4+
Given an array of integers nums and an integer target,
5+
return indices of the two numbers such that they add up to target.
6+
You may assume that each input would have exactly one solution,
7+
and you may not use the same element twice.
68
You can return the answer in any order.
79

810

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /