Merge pull request #1 from bilong/patch-1

Patch 1

Author: bilong

190 Reverse Bits.js

@@ -1,19 +1,19 @@
 // Leetcode #190
 // Language: Javascript
 // Problem: https://leetcode.com/problems/reverse-bits/
-// Author: Chihung Yu
+// Author: Bilong HUANG
 /**
  * @param {number} n - a positive integer
  * @return {number} - a positive integer
  */
 var reverseBits = function(n) {
-    var result =  0;
+    var s = n.toString(2).split(""), c="";
 
-    for(var i = 0; i < 32; i++){
-        result <<= 1;
-        result |= n & 1;
-        n >>= 1;
+    for(i=0; i<32; i++){
+        if ((s[s.length-1-i] == "0") || (s[s.length-1-i] == "1"))
+            c = c + s[s.length-1-i];
+        else c = c + "0";
     }
 
-    return Math.abs(result);
-};
+    return parseInt(c, 2);
+};

2 Add Two Numbers.js

@@ -1,4 +1,5 @@
 /**
+ * Author: Bilong HUANG
  * Definition for singly-linked list.
  * function ListNode(val) {
  *     this.val = val;
@@ -11,51 +12,27 @@
  * @return {ListNode}
  */
 var addTwoNumbers = function(l1, l2) {
-    if(l1 === null || l2 === null){
-        return l1 || l2;
-    }
-    
-    var result = new ListNode(0);
-    var cur = result;
-    var p = l1;
-    var q = l2;
-    var carry = 0;
+    var result, node_current, node, add = 0;
 
-    while(p || q){
-        var qval;
-        var pval;
-        
-        if(q){
-            qval = q.val;
-            q = q.next;
-        } else {
-            qval = 0;
-        }
-        
-        if(p){
-            pval = p.val;
-            p = p.next;
-        } else {
-            pval = 0;
-        }
+    while ( l1 || l2 ) {
+        node = new ListNode((l1 ? l1.val : 0) + (l2 ? l2.val : 0) + add);
 
-        var val = qval + pval + carry;
+        if ( add = Math.floor(node.val / 10))
+            node.val = node.val % 10;
+            
+        if (result == null)
+            result = node;
+        else
+            node_current.next = node;
 
-        if(val > 9){
-            carry = 1;
-            val %= 10;
-        } else {
-            carry = 0;
-        }
+        if (l1) l1 = (l1.next ? (l1 = l1.next) : null);
+        if (l2) l2 = (l2.next ? (l2 = l2.next) : null);
 
-        cur.next = new ListNode(val);
-        cur = cur.next;
+        node_current = node;
     }
 
-    if(carry !== 0){
-        cur.next = new ListNode(1);
-    }
-    
-    return result.next;
-    
-};
+    if (add !== 0) 
+        node_current.next = new ListNode(add);
+
+    return result;
+};