Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork5.7k
Int To Base#1243
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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Open
Saimon398 wants to merge6 commits intoTheAlgorithms:masterChoose a base branch
base:master
Could not load branches
Branch not found:{{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline, and old review comments may become outdated.
Uh oh!
There was an error while loading.Please reload this page.
Open
Int To Base#1243
Changes fromall commits
Commits
Show all changes
6 commits Select commitHold shift + click to select a range
d648030 algorithm: add UniquePaths2 algorithm
Saimon3981005207 test: add test for UniquePaths2.js
Saimon398b888548 algorithm: add HornerScheme algorithm
Saimon398d4e1ec9 test: add test for Maths/HornerScheme.js
Saimon398be56ea7 fix: fixed spelling errors in Horner Scheme tests
Saimon3981d81d40 refactor: refactor code in intToBase.js
Saimon398File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Jump to
Jump to file
Failed to load files.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,80 @@ | ||
| /* | ||
| * Unique Paths 2 | ||
| * | ||
| * There is a robot on an `m x n` grid. | ||
| * The robot is initially located at the top-left corner | ||
| * The robot tries to move to the bottom-right corner. | ||
| * The robot can only move either down or right at any point in time. | ||
| * | ||
| * Given grid with obstacles | ||
| * An obstacle and space are marked as 1 or 0 respectively in grid. | ||
| * A path that the robot takes cannot include any square that is an obstacle. | ||
| * Return the number of possible unique paths that the robot can take to reach the bottom-right corner. | ||
| * | ||
| * More info: https://leetcode.com/problems/unique-paths-ii/ | ||
| */ | ||
| /** | ||
| * @description Return 'rows x columns' grid with cells filled by 'filler' | ||
| * @param {Number} rows Number of rows in the grid | ||
| * @param {Number} columns Number of columns in the grid | ||
| * @param {String | Number | Boolean} filler The value to fill cells | ||
| * @returns {Object []} | ||
| */ | ||
| const generateMatrix = (rows, columns, filler = 0) => { | ||
| const matrix = [] | ||
| for (let i = 0; i < rows; i += 1) { | ||
| const submatrix = [] | ||
| for (let k = 0; k < columns; k += 1) { | ||
| submatrix[k] = filler | ||
| } | ||
| matrix[i] = submatrix | ||
| } | ||
| return matrix | ||
| } | ||
| /** | ||
| * @description Return number of unique paths | ||
| * @param {Object []} obstacles Obstacles grid | ||
| * @returns {Number} | ||
| */ | ||
| const uniquePaths2 = (obstacles) => { | ||
| if (!(obstacles instanceof Object)) { | ||
| throw new Error('Input data must be type of Array') | ||
| } | ||
| // Create grid for calculating number of unique ways | ||
| const rows = obstacles.length | ||
| const columns = obstacles[0].length | ||
| const grid = generateMatrix(rows, columns) | ||
| // Fill the outermost cell with 1 b/c it has | ||
| // the only way to reach neighbor | ||
| for (let i = 0; i < rows; i += 1) { | ||
| // If robot encounters an obstacle in these cells, | ||
| // he cannot continue movind in that direction | ||
| if (obstacles[i][0]) { | ||
| break | ||
| } | ||
| grid[i][0] = 1 | ||
| } | ||
| for (let j = 0; j < columns; j += 1) { | ||
| if (obstacles[0][j]) { | ||
| break | ||
| } | ||
| grid[0][j] = 1 | ||
| } | ||
| // Fill the rest of grid by dynamic programming | ||
| // using following reccurent formula: | ||
| // K[i][j] = K[i - 1][j] + K[i][j - 1] | ||
| for (let i = 1; i < rows; i += 1) { | ||
| for (let j = 1; j < columns; j += 1) { | ||
| if (obstacles[i][j]) { | ||
| grid[i][j] = 0 | ||
| } else { | ||
| grid[i][j] = grid[i - 1][j] + grid[i][j - 1] | ||
| } | ||
| } | ||
| } | ||
| return grid[rows - 1][columns - 1] | ||
| } | ||
| export { uniquePaths2 } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,19 @@ | ||
| import { uniquePaths2 } from '../UniquePaths2' | ||
| describe('Unique Paths2', () => { | ||
| // Should return number of ways, taken into account the obstacles | ||
| test('Case 1: 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('Case 2: 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('Case 3: there are wrong type of input data', () => { | ||
| expect(() => uniquePaths2('wrong input')).toThrow() | ||
| expect(() => uniquePaths2(100)).toThrow() | ||
| }) | ||
| }) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,40 @@ | ||
| /** | ||
| * @function intToBase | ||
| * @description Convert a number from decimal system to another (till decimal) | ||
| * @param {Number} number Number to be converted | ||
| * @param {Number} base Base of new number system | ||
| * @returns {String} Converted Number | ||
| * @see [HornerMethod](https://en.wikipedia.org/wiki/Horner%27s_method) | ||
| * @example | ||
| * const num1 = 125 // Needs to be converted to the binary number system | ||
| * gornerScheme(num, 2); // ===> 1111101 | ||
| * @example | ||
| * const num2 = 125 // Needs to be converted to the octal number system | ||
| * gornerScheme(num, 8); // ===> 175 | ||
| */ | ||
| const intToBase = (number, base) => { | ||
| if (typeof number !== 'number' || typeof base !== 'number') { | ||
| throw new Error('Input data must be numbers') | ||
| } | ||
| // Zero in any number system is zero | ||
| if (number === 0) { | ||
| return '0' | ||
| } | ||
| let absoluteValue = Math.abs(number) | ||
| let convertedNumber = '' | ||
| while (absoluteValue > 0) { | ||
| // Every iteration last digit is taken away | ||
| // and added to the previous one | ||
| const lastDigit = absoluteValue % base | ||
| convertedNumber = lastDigit + convertedNumber | ||
| absoluteValue = Math.trunc(absoluteValue / base) | ||
| } | ||
| // Result is whether negative or positive, | ||
| // depending on the original value | ||
| if (number < 0) { | ||
| convertedNumber = '-' + convertedNumber | ||
| } | ||
| return convertedNumber | ||
| } | ||
| export { intToBase } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,25 @@ | ||
| import { intToBase } from '../intToBase' | ||
| describe('Int to Base', () => { | ||
| test('Conversion to the binary system', () => { | ||
| expect(intToBase(210, 2)).toEqual('11010010') | ||
| expect(intToBase(-210, 2)).toEqual('-11010010') | ||
| }) | ||
| test('Conversion to the system with base 5', () => { | ||
| expect(intToBase(210, 5)).toEqual('1320') | ||
| expect(intToBase(-210, 5)).toEqual('-1320') | ||
| }) | ||
| test('Conversion to the octal system', () => { | ||
| expect(intToBase(210, 8)).toEqual('322') | ||
| expect(intToBase(-210, 8)).toEqual('-322') | ||
| }) | ||
| test('Output is 0', () => { | ||
| expect(intToBase(0, 8)).toEqual('0') | ||
| expect(intToBase(0, 8)).toEqual('0') | ||
| }) | ||
| test('Throwing an exception', () => { | ||
| expect(() => intToBase('string', 2)).toThrow() | ||
| expect(() => intToBase(10, 'base')).toThrow() | ||
| expect(() => intToBase(true, false)).toThrow() | ||
| }) | ||
| }) |
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.