add new less

Author: JackPu

Diff for: coverage/coverage-final.json

@@ -589,6 +589,43 @@ BRF:25
 BRH:21
 end_of_record
 TN:
+SF:/Users/ali-130257n/www/JavaScript-Algorithm-Learning/tests/leetcode/palindrome-number.test.js
+FN:2,(anonymous_0)
+FNF:1
+FNH:1
+FNDA:1,(anonymous_0)
+DA:1,1
+DA:2,1
+DA:3,1
+DA:4,1
+LF:4
+LH:4
+BRF:0
+BRH:0
+end_of_record
+TN:
+SF:/Users/ali-130257n/www/JavaScript-Algorithm-Learning/src/leetcode/palindrome-number.js
+FN:5,(anonymous_0)
+FNF:1
+FNH:1
+FNDA:2,(anonymous_0)
+DA:5,1
+DA:6,2
+DA:7,0
+DA:9,2
+DA:10,2
+DA:11,2
+DA:12,3
+DA:13,3
+DA:15,2
+LF:9
+LH:8
+BRDA:6,0,0,0
+BRDA:6,0,1,2
+BRF:2
+BRH:1
+end_of_record
+TN:
 SF:/Users/ali-130257n/www/JavaScript-Algorithm-Learning/tests/leetcode/reverse-integer.test.js
 FN:2,(anonymous_0)
 FNF:1

Diff for: coverage/lcov.info

@@ -0,0 +1,30 @@
+// https://leetcode.com/problems/longest-substring-without-repeating-characters/description/
+
+
+const lengthOfLongestSubstring = function(str) {
+    var str  = "dvdf"; // abc
+    let i = 0;
+    let maxSubstring = str[i];
+    let currentMaxString = str[i];
+    let position = 0;
+    for(let j = 1; j < str.length; j++){
+        if(currentMaxString.indexOf(str[j]) >= 0) {
+            i = currentMaxString.indexOf(str[j]) + 1 + position;
+            if (currentMaxString.length > maxSubstring.length) {
+                maxSubstring = currentMaxString;
+            }
+            if (i ===  j) {
+                currentMaxString = str[j];
+            } else {
+                currentMaxString = str.substring(i, j);
+                str = str.substr(i);
+            }
+            continue;
+        }
+        currentMaxString += str[j];
+        maxSubstring = currentMaxString;
+    }
+    return maxSubstring;
+};
+lengthOfLongestSubstring()
+module.exports = lengthOfLongestSubstring;

Diff for: src/leetcode/longest-substring-without-repeating-characters.js

@@ -0,0 +1,16 @@
+// https://leetcode.com/problems/palindrome-number/description/
+
+// examples:123 false 121 true
+
+module.exports = function (x) {
+    if (x < 0) {
+        return false;
+    }
+    var m = x;
+    var n = 0;
+    while(n < m) {
+        n += (m % 10 + n * 10)
+        m = Math.floor(m / 10)
+    }
+    return n === x
+}

Diff for: src/leetcode/palindrome-number.js

@@ -0,0 +1,32 @@
+// https://leetcode.com/problems/reverse-integer/description/
+
+/**
+Given a 32-bit signed integer, reverse digits of an integer.
+
+Example 1:
+
+Input: 123
+Output:  321
+Example 2:
+
+Input: -123
+Output: -321
+ */
+
+
+const reverseInteger = function (num) {
+    let isNegative = false;
+    if (Math.abs(num) !== num) {
+        isNegative = true;
+    }
+    let numstr = num + '';
+    numstr = numstr.replace('-', '');
+    const arr = numstr.split('');
+    arr.reverse();
+    const result = 0 + arr.join('') * (isNegative ? -1 : 1)
+    if (result >= (Math.pow(2, 31) - 1) || result <= -Math.pow(2, 31)) {
+        return 0;
+    }
+    return result;
+};
+module.exports = reverseInteger;

Diff for: src/leetcode/reverse-integer.js

@@ -0,0 +1,5 @@
+const check = require('../../src/leetcode/palindrome-number');
+it('palindrome-number', function () {
+    expect(check(123)).toEqual(false);
+    expect(check(1)).toEqual(true);
+});

Diff for: tests/leetcode/palindrome-number.test.js

@@ -0,0 +1,5 @@
+const reverseInteger = require('../../src/leetcode/reverse-integer');
+it('two sum', function () {
+    expect(reverseInteger(123)).toEqual(321);
+    expect(reverseInteger(-123)).toEqual(-321);
+});