Commit e6f2a2b

committed

Add solution to 165.

1 parent 7073529 commit e6f2a2bCopy full SHA for e6f2a2b

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+/**`
	`2`	`+ * @param {string} version1`
	`3`	`+ * @param {string} version2`
	`4`	`+ * @return {number}`
	`5`	`+ */`
	`6`	`+var compareVersion = function (version1, version2) {`
	`7`	`+ const v1Parts = version1.split(".").map((x) => Number.parseInt(x));`
	`8`	`+ const v2Parts = version2.split(".").map((x) => Number.parseInt(x));`
	`9`	`+`
	`10`	`+ let n1 = v1Parts.length;`
	`11`	`+ let n2 = v2Parts.length;`
	`12`	`+ const sizeDiff = Math.abs(n2 - n1);`
	`13`	`+ if (n1 < n2) {`
	`14`	`+ for (let i = 0; i < sizeDiff; i++) {`
	`15`	`+ v1Parts.push(0);`
	`16`	`+ }`
	`17`	`+ n1 = v1Parts.length;`
	`18`	`+ } else if (n2 < n1) {`
	`19`	`+ for (let i = 0; i < sizeDiff; i++) {`
	`20`	`+ v2Parts.push(0);`
	`21`	`+ }`
	`22`	`+ n2 = v2Parts.length;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ let result = 0;`
	`26`	`+ for (let i = 0; i < n1; i++) {`
	`27`	`+ if (v1Parts[i] < v2Parts[i]) {`
	`28`	`+ return -1;`
	`29`	`+ } else if (v1Parts[i] > v2Parts[i]) {`
	`30`	`+ return 1;`
	`31`	`+ }`
	`32`	`+ }`
	`33`	`+`
	`34`	`+ return result;`
	`35`	`+};`

Comments

(0)