Movatterモバイル変換


[0]ホーム

URL:


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

Commit0dd40b3

Browse files
refactor 1
1 parentf80a7e1 commit0dd40b3

File tree

1 file changed

+1
-0
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+1
-0
lines changed

‎src/main/java/com/fishercoder/solutions/_1.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -8,6 +8,7 @@
88
*
99
* Given an array of integers, return indices of the two numbers such that they add up to a specific target.
1010
* You may assume that each input would have exactly one solution, and you may not use the same element twice.
11+
*
1112
* Example:
1213
* Given nums = [2, 7, 11, 15], target = 9,
1314
* Because nums[0] + nums[1] = 2 + 7 = 9,

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp