Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
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
3 changes: 3 additions & 0 deletions .babelrc
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
{
"presets": ["env"]
}
3 changes: 3 additions & 0 deletions .travis.yml
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
language: node_js
node_js:
- "lts/*"
4 changes: 4 additions & 0 deletions package.json
Original file line number Diff line number Diff line change
Expand Up @@ -23,6 +23,10 @@
},
"homepage": "https://github.com/front-camp-2018/project-scaffoldings#readme",
"devDependencies": {
"babel-cli": "^6.26.0",
"babel-core": "^6.26.3",
"babel-jest": "^23.6.0",
"babel-preset-env": "^1.7.0",
"css-loader": "^1.0.0",
"eslint": "^5.6.1",
"eslint-plugin-jest": "^21.25.1",
Expand Down
49 changes: 48 additions & 1 deletion src/dragon-curve/index.js
Original file line number Diff line number Diff line change
@@ -1,3 +1,50 @@
export const dragonCurve = n => {
// logic...
let size = Math.pow(2, n);
let arr = [];
arr.length = --size;
arr = getDirections(n);
const result = Number(arr.join(''));

return result;
};

const getDirections = number => {

Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

дуже складна логіка!

let size = Math.pow(2, number);
const arr = [];
arr.length = --size;

if (number === 1) {
arr[0] = 1;
return arr;
} else {
let sizeOther = Math.pow(2, number - 1);
let arrOther = [];
arrOther.length = --sizeOther;
arrOther = getDirections(number - 1);

for (let i = 0; i < sizeOther; i++) {
arr[i] = arrOther[i];
}

arr[sizeOther] = 1;

for (let i = 0; i < sizeOther; i++) {
if (arrOther[i] === 1) {
arrOther[i] = 0;
} else {
arrOther[i] = 1;
}
}

let index = 0;

for (let i = size - 1; i > size / 2; i--) {
arr[i] = arrOther[index];
index++;
}

return arr;
}

};

9 changes: 7 additions & 2 deletions src/dragon-curve/index.spec.js
Original file line number Diff line number Diff line change
@@ -1,5 +1,10 @@
import {dragonCurve} from './index'
import {dragonCurve} from './index';

describe('dragonCurve::', () => {
// need to implement
it('Should return number as is', () => {
expect(dragonCurve(1)).toEqual(1);
expect(dragonCurve(2)).toEqual(110);
expect(dragonCurve(3)).toEqual(1101100);
expect(dragonCurve(4)).toEqual(110110011100100);
});
});
18 changes: 17 additions & 1 deletion src/rotate-matrix/index.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,20 @@
export const rotateMatrix = arr => {
// logic...
const width = arr.length || 0;
const height = arr[0] instanceof Array ? arr[0].length : 0;

if (height === 0 || width === 0) {
return [];
}

const transformation = [];

for (let i = 0; i < height; i++) {
transformation[i] = [];
for (let j = 0; j < width; j++) {
transformation[i][j] = arr[j][i];
}
}

return transformation;
};

23 changes: 21 additions & 2 deletions src/rotate-matrix/index.spec.js
Original file line number Diff line number Diff line change
@@ -1,5 +1,24 @@
import {rotateMatrix} from './index'
import {rotateMatrix} from './index';

describe('rotateMatrix::', () => {
// need to implement
const arr1 = [
[1, 2],
[3, 4]
];
const arr2 = [
[1, 2, 3],
[4, 5, 6],
[7, 8, 9]
];
it('Should return', () => {
expect(rotateMatrix(arr1)).toEqual([
[1,3],
[2,4]
]);
expect(rotateMatrix(arr2)).toEqual([
[1,4,7],
[2,5,8],
[3,6,9]
]);
});
});