Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Fixed Problem 1 example for 1-based indexing #175

Closed
wants to merge 1 commit into from
Closed

Fixed Problem 1 example for 1-based indexing #175

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions src/problems/1.two-sum.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@
# ---
#
# Given an array of integers `nums` and an integer `target`, return _indices of
# the two numbers such that they add up to`target`_.
# the two numbers so that they add up to `target`_.
#
# You may assume that each input would have **_exactly_ one solution**, and you
# may not use the _same_ element twice.
Expand All @@ -24,31 +24,31 @@
#
#
# Input: nums = [2,7,11,15], target = 9
# Output: [0,1]
# Output: Because nums[0] + nums[1] == 9, we return [0, 1].
# Output: [1, 2]
# Output: Because nums[1] + nums[2] == 9, we return [1, 2].
#
#
# **Example 2:**
#
#
#
# Input: nums = [3,2,4], target = 6
# Output: [1,2]
# Output: [2, 3]
#
#
# **Example 3:**
#
#
#
# Input: nums = [3,3], target = 6
# Output: [0,1]
# Output: [1, 2]
#
#
#
#
# **Constraints:**
#
# * `2 <= nums.length <= 103`
# * `2 <= length(nums) <= 103`
# * `-109 <= nums[i] <= 109`
# * `-109 <= target <= 109`
# * **Only one valid answer exists.**
Expand Down
Loading