add scripts

Author: everthis

167-two-sum-II-input-array-is-sorted.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} numbers
+ * @param {number} target
+ * @return {number[]}
+ */
+const twoSum = function(numbers, target) {
+  const res = [];
+  let remaining;
+  let next = 0;
+  for (let i = 0; i < numbers.length; i++) {
+    remaining = target - numbers[i];
+    next = i + 1;
+    while (next < numbers.length && numbers[next] <= remaining) {
+      if (numbers[next] === remaining) {
+        res.push(i + 1, next + 1);
+        break;
+      }
+      next += 1;
+    }
+  }
+
+  return res;
+};

387-first-unique-character-in-a-string.js

@@ -0,0 +1,28 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+const firstUniqChar = function(s) {
+  const arr = [];
+  const res = [];
+  const hash = {};
+  let tmp;
+  let idx;
+  for (let i = 0; i < s.length; i++) {
+    tmp = s.charAt(i);
+    if (hash.hasOwnProperty(tmp)) {
+      idx = arr.indexOf(tmp);
+      if (idx >= 0) {
+        arr.splice(idx, 1);
+        res.splice(idx, 1);
+      }
+
+      hash[tmp] += 1;
+    } else {
+      arr.push(tmp);
+      res.push(i);
+      hash[tmp] = 1;
+    }
+  }
+  return res[0] == null ? -1 : res[0];
+};

485-max-consecutive-ones.js

@@ -3,16 +3,17 @@
  * @return {number}
  */
 const findMaxConsecutiveOnes = function(nums) {
-    let sum = 0, max = 0;
-  
-    for (let i = 0; i < nums.length; i++) {
-      let temp = sum;
-      sum += nums[i];
-      if (temp === sum || i === nums.length - 1) {
-        max = Math.max(sum, max);
-        sum = 0;
-      }
+  let sum = 0,
+    max = 0;
+
+  for (let i = 0; i < nums.length; i++) {
+    let temp = sum;
+    sum += nums[i];
+    if (temp === sum || i === nums.length - 1) {
+      max = Math.max(sum, max);
+      sum = 0;
     }
-  
-    return max;
-  }
+  }
+
+  return max;
+};

714-best-time-to-buy-and-sell-stock-with-transaction-fee.js

@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} prices
+ * @param {number} fee
+ * @return {number}
+ */
+const maxProfit = function(prices, fee) {
+  let cash = 0,
+    hold = -prices[0];
+  for (let i = 1; i < prices.length; i++) {
+    cash = Math.max(cash, hold + prices[i] - fee);
+    hold = Math.max(hold, cash - prices[i]);
+  }
+  return cash;
+};
+
+console.log(maxProfit([1, 3, 2, 8, 4, 9], 2));

README.md

@@ -0,0 +1 @@
+### JavaScript solutions of LeetCode problems