Commit d6d1d12

committed

updates reverse integer in js

1 parent 0de9fd7 commit d6d1d12Copy full SHA for d6d1d12

File tree

+37

-3

lines changed

+37

-3

lines changed

Lines changed: 9 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,16 +1,22 @@`
`1`		`-// https://leetcode.com/problems/reverse-integer/`
	`1`	`+// https://leetcode.com/problems/reverse-integer`
	`2`	`+// T: O(log(n))`
	`3`	`+// S: O(1)`
`2`	`4`
`3`		`-var reverse = function (x) {`
	`5`	`+const INTEGER_MAX_VAL = 2147483647;`
	`6`	`+`
	`7`	`+const reverse = x => {`
`4`	`8`	`let result = 0;`
`5`	`9`	`const isNegative = x <= 0;`
`6`	`10`	`let absNumber = Math.abs(x);`
	`11`	`+`
`7`	`12`	`while (absNumber !== 0) {`
`8`	`13`	`let remainder = absNumber % 10;`
`9`	`14`	`absNumber = Math.floor(absNumber / 10);`
`10`	`15`	`result = result * 10 + remainder;`
`11`		`- if (result > 2147483647) {`
	`16`	`+ if (result > INTEGER_MAX_VAL) {`
`12`	`17`	`return 0;`
`13`	`18`	`}`
`14`	`19`	`}`
	`20`	`+`
`15`	`21`	`return isNegative ? -result : result;`
`16`	`22`	`};`

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,28 @@`
	`1`	`+import java.util.Arrays;`
	`2`	`+`
	`3`	`+public class UglyNumberIII {`
	`4`	`+ public static int nthUglyNumber(int n, int a, int b, int c) {`
	`5`	`+ final int[] dp = new int[n + 1];`
	`6`	`+ dp[0] = 1;`
	`7`	`+ int factorA = a, factorB = b, factorC = c;`
	`8`	`+ int indexA = 0, indexB = 0, indexC = 0;`
	`9`	`+`
	`10`	`+ for (int i = 1 ; i < dp.length ; i++) {`
	`11`	`+ final int uglyNumber = min(factorA, factorB, factorC);`
	`12`	`+ dp[i] = uglyNumber;`
	`13`	`+ if (uglyNumber == factorA) factorA = a * dp[++indexA];`
	`14`	`+ if (uglyNumber == factorB) factorB = b * dp[++indexB];`
	`15`	`+ if (uglyNumber == factorC) factorC = c * dp[++indexC];`
	`16`	`+ }`
	`17`	`+ System.out.println(Arrays.toString(dp));`
	`18`	`+ return dp[dp.length - 1];`
	`19`	`+ }`
	`20`	`+`
	`21`	`+ private static int min(int a, int b, int c) {`
	`22`	`+ return Math.min(a, Math.min(b, c));`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ public static void main(String[] args) {`
	`26`	`+ System.out.println(nthUglyNumber(100, 2, 3, 5));`
	`27`	`+ }`
	`28`	`+}`

Comments

(0)