integer to english

Author: jyxia

Easy/104-maxDepth.js

@@ -30,3 +30,12 @@ var maxDepth = function(root) {
     var rHeight = maxDepth(root.right) + 1;
     return lHeight > rHeight ? lHeight : rHeight;
 };
+
+// simplist
+var maxDepth = function(root) {
+    if (!root) {
+        return 0;
+    }
+
+    return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
+};

Hard/273-integerToEnglish.js

@@ -0,0 +1,88 @@
+/**
+ * @param {number} num
+ * @return {string}
+ */
+
+// my own solution 
+var numberToWords = function(num) {
+    var dict = { 1: 'One', 2: 'Two', 3: 'Three', 4: 'Four', 5: 'Five',
+        6: 'Six', 7: 'Seven', 8: 'Eight', 9: 'Nine', 10: 'Ten',
+        11: 'Eleven', 12: 'Twelve', 13: 'Thirteen', 14: 'Fourteen',
+        15: 'Fifteen', 16: 'Sixteen', 17: 'Seventeen', 18: 'Eighteen',
+        19: 'Nineteen', 20: 'Twenty', 30: 'Thirty', 40: 'Forty',
+        50: 'Fifty', 60: 'Sixty', 70: 'Seventy', 80: 'Eighty',
+        90: 'Ninety'};
+    var str = '';
+
+    if (num === 0) {
+        return 'Zero';
+    }
+
+    for (var i = 9; i >= 0;) {
+        var most = Math.floor(num / Math.pow(10, i));
+        num = num % Math.pow(10, i);
+
+        if (i === 9 && most > 0) {
+            str += dict[most] + ' Billion ';
+        }
+
+        if (i === 6 && most > 0) {
+            str += threeDigits(most, dict) + ' Million ';
+        }
+
+        if (i === 3 && most > 0) {
+            str += threeDigits(most, dict) + ' Thousand ';
+        }
+
+        if (i === 0 && most > 0) {
+            str += threeDigits(most, dict);
+        }
+
+        if (num === 0) {
+            str = str.trim();
+            break;
+        }
+
+        i -= 3;
+    }
+
+    return str;
+};
+
+var threeDigits = function(num, dict) {
+    var hundred = 0;
+    var rem = 0;
+    var str = '';
+
+    if (num === 0) {
+      return '';
+    } else if (num < 100) {
+        str = twoDigits(num, dict);
+    } else {
+        hundred = Math.floor(num / 100);
+        str = dict[hundred] + ' Hundred';
+        rem = num % 100;
+
+        if (rem <= 10 && rem > 0) {
+            str += ' ' + dict[rem];
+        } else if (rem > 10) {
+            str += ' ' + twoDigits(rem, dict);
+        }
+    }
+
+    return str;
+};
+
+var twoDigits = function twoDigits(num, dict) {
+    var str = '';
+    var least = Math.floor(num % 10);
+    var most = num - least;
+
+    if (least === 0 || num <= 20) {
+        str += dict[num];
+    } else {
+        str += dict[most] + ' ' + dict[least];
+    }
+
+    return str;
+}

README.md

@@ -200,4 +200,5 @@
 * [132. Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/) -  [Solution](./Hard/132-palindromePartitioningII.js)
 * [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) -  [Solution](./Hard/145-binaryTreePostorder.js)
 * [154.	Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) - [Solution](./Hard/154-findMinimumInRotatedSortedArray-II.js)
+* [273. Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) - [Solution](./Hard/273-integerToEnglish.js)
 * [287. Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) - [Solution](./Hard/287-findDuplicateNumber.js)