Commit 6c93d8c

committed

update: test cases, prettier rc file for cross IDE code format

1 parent fee46b9 commit 6c93d8cCopy full SHA for 6c93d8c

File tree

+49

-6

lines changed

+49

-6

lines changed

Lines changed: 7 additions & 0 deletions

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+const { composeHighest, compare } = require('.');`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * Test cases`
	`5`	`+ * [3, 6, 0, 9] -> 9630`
	`6`	`+ * [60, 548] -> 60548`
	`7`	`+ * [1, 34, 3, 98, 9, 76, 45, 4] -> 998764543431`
	`8`	`+ */`
	`9`	`+`
	`10`	`+describe('Compose Largest Number', () => {`
	`11`	`+ describe('The main function returning the Highest NUmber', () => {`
	`12`	+ it('Should return 9630 for `[3, 6, 0, 9]`', () => {
	`13`	`+ expect(composeHighest([3, 6, 0, 9])).toEqual(9630);`
	`14`	`+ });`
	`15`	`+`
	`16`	+ it('Should return 60548 for `[60, 548]`', () => {
	`17`	`+ expect(composeHighest([60, 548])).toEqual(60548);`
	`18`	`+ });`
	`19`	`+`
	`20`	+ it('Should return 998764543431 for `[1, 34, 3, 98, 9, 76, 45, 4]`', () => {
	`21`	`+ expect(composeHighest([1, 34, 3, 98, 9, 76, 45, 4])).toEqual(998764543431);`
	`22`	`+ });`
	`23`	`+ });`
	`24`	`+`
	`25`	+ describe('Testing `compare()`', () => {
	`26`	`+ it('Should return [60, 548] instead of [548, 60]', () => {`
	`27`	`+ expect([60, 548].sort(compare)).toEqual([60, 548]);`
	`28`	`+ });`
	`29`	`+`
	`30`	`+ it('Should return [9, 81, 548] instead of [548, 81, 9]', () => {`
	`31`	`+ expect([548, 9, 81].sort(compare)).toEqual([9, 81, 548]);`
	`32`	`+ });`
	`33`	`+ });`
	`34`	`+});`

Lines changed: 8 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@`
`8`	`8`	`*/`
`9`	`9`
`10`	`10`	`/** At first glance, the below solution may seem the answer */`
`11`		`-const hightestNumber = Number([60, 548].sort((a, b) => b - a).join(""));`
	`11`	`+// const hightestNumber = Number([60, 548].sort((a, b) => b - a).join(''));`
`12`	`12`
`13`	`13`	`/** The above will fail for test case 2 & 3 */`
`14`	`14`
`@@ -22,14 +22,16 @@ function compare(a, b) {`
`22`	`22`	`/** final function */`
`23`	`23`	`function composeHighest(arr) {`
`24`	`24`	`if (!arr \|\| !Array.isArray(arr)) {`
`25`		`- throw new Error("Invalid array/missing argument");`
	`25`	`+ throw new Error('Invalid array/missing argument');`
`26`	`26`	`}`
`27`	`27`
`28`		`- return Number(arr.sort(compare).join(""));`
	`28`	`+ return Number(arr.sort(compare).join(''));`
`29`	`29`	`}`
`30`	`30`
`31`	`31`	`/** tests */`
`32`	`32`
`33`		`-console.log(composeHighest([3, 6, 0, 9]) === 9630);`
`34`		`-console.log(composeHighest([60, 548]) === 60548);`
`35`		`-console.log(composeHighest([1, 34, 3, 98, 9, 76, 45, 4]) === 998764543431);`
	`33`	`+// console.log(composeHighest([3, 6, 0, 9]) === 9630);`
	`34`	`+// console.log(composeHighest([60, 548]) === 60548);`
	`35`	`+// console.log(composeHighest([1, 34, 3, 98, 9, 76, 45, 4]) === 998764543431);`
	`36`	`+`
	`37`	`+module.exports = { composeHighest, compare };`

Comments

(0)