mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
44 lines
1021 B
JavaScript
44 lines
1021 B
JavaScript
import { uniquePaths2 } from '../UniquePaths2'
|
|
|
|
describe('Unique Paths2', () => {
|
|
// Should return number of ways, taken into account the obstacles
|
|
test('There are obstacles in the way', () => {
|
|
expect(
|
|
uniquePaths2([
|
|
[0, 0, 0],
|
|
[0, 1, 0],
|
|
[0, 0, 0]
|
|
])
|
|
).toEqual(2)
|
|
expect(
|
|
uniquePaths2([
|
|
[0, 0, 0],
|
|
[0, 1, 0],
|
|
[0, 0, 0],
|
|
[1, 0, 0]
|
|
])
|
|
).toEqual(3)
|
|
})
|
|
// Should return number of all possible ways to reach right-bottom corner
|
|
test('There are no obstacles in the way', () => {
|
|
expect(
|
|
uniquePaths2([
|
|
[0, 0, 0],
|
|
[0, 0, 0],
|
|
[0, 0, 0]
|
|
])
|
|
).toEqual(6)
|
|
expect(
|
|
uniquePaths2([
|
|
[0, 0, 0],
|
|
[0, 0, 0]
|
|
])
|
|
).toEqual(3)
|
|
})
|
|
// Should throw an exception b/c input data has wrong type
|
|
test('There are wrong type of input data', () => {
|
|
expect(() => uniquePaths2('wrong input')).toThrow()
|
|
expect(() => uniquePaths2(100)).toThrow()
|
|
})
|
|
})
|