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

[pull] master from TheAlgorithms:master #62

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.

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

Merged
pull merged 2 commits into AlgorithmAndLeetCode:master from TheAlgorithms:master
Oct 4, 2023
Merged
Show file tree
Hide file tree
Changes from 1 commit
Commits
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
Prev Previous commit
Feat: TwoSum function created with test cases (TheAlgorithms#1399) 
* fix: TheAlgorithms#758 optimised armstrongNumber code
* fix:TheAlgorithms#758 Average Median code optimised
* feat: TwoSum function added with test cases
* revert code
* Fix: TheAlgorithms#758 used ternary operator to make code more optimised
* Feat: TwoSum function created with test cases
* Feat: TwoSum function created with test cases
* Resolved comments and changes requests
  • Loading branch information
commit 1de5ab7d71d0241ec1903f54d96c9924ab912d2b
24 changes: 24 additions & 0 deletions Maths/TwoSum.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
/**
* Given an array of integers, find two numbers that add up to a specific target.
*
* @param {number[]} nums - The array of integers.
* @param {number} target - The target sum.
* @returns {number[]} - An array containing the indices of the two numbers.
*
* @example
* const nums = [2, 7, 11, 15];
* const target = 9;
* const result = twoSum(nums, target);
* // The function should return [0, 1] because nums[0] + nums[1] = 2 + 7 = 9.
*/

const TwoSum = (nums, target) => {
const numIndicesMap = new Map()
for (let i = 0; i < nums.length; i++) {
const complement = target - nums[i]
if (numIndicesMap.has(complement)) return [numIndicesMap.get(complement), i]
numIndicesMap.set(nums[i], i)
}
return []
}
export { TwoSum }
28 changes: 28 additions & 0 deletions Maths/test/TwoSum.test.js
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
import { TwoSum } from '../TwoSum.js'
describe('Two Sum', () => {
const testCasesWithoutSolution = [
[[8], 8],
[[3, 3, 3, 3], 19]
]
const testCasesWithSolution = [
[[2, 7, 11, 15], 9, [0, 1]],
[[15, 2, 11, 7], 13, [1, 2]],
[[2, 7, 11, 15], 17, [0, 3]],
[[7, 15, 11, 2], 18, [0, 2]],
[[2, 7, 11, 15], 26, [2, 3]]
]

test.each(testCasesWithoutSolution)(
'Should return an empty array if there is no solution',
(nums, target) => {
expect(TwoSum(nums, target)).toEqual([])
}
)

test.each(testCasesWithSolution)(
'Should return the indices of two numbers that add up to the target',
(nums, target, expected) => {
expect(TwoSum(nums, target)).toEqual(expected)
}
)
})

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