solutions

Author: liuhanqu

algorithms/easy/maxProfit/maxProfit.js

@@ -0,0 +1,17 @@
+// description: https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/22/
+// 买卖股票的最佳时机 II
+
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+var maxProfit = function(prices) {
+  var pro = 0;
+  var len = prices.length;
+  for (var i = 0; i < len; i++) {
+    if (prices[i] < prices[i + 1]) {
+      pro += prices[i + 1] - prices[i];
+    }
+  }
+  return pro;
+};

algorithms/easy/removeDuplicates/removeDuplicates.js

@@ -0,0 +1,18 @@
+// description: https://leetcode-cn.com/explore/interview/card/top-interview-questions-easy/1/array/21/
+// 从排序数组中删除重复项
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function(nums) {
+  var len = 1;
+  for (var i = 1, nlen = nums.length; i < nlen; i++) {
+    if (nums[i] !== nums[i - 1]) {
+      nums[len] = nums[i];
+      len++;
+    }
+  }
+
+  return len;
+};

algorithms/easy/reverse/reverse.js

@@ -1,4 +1,4 @@
-// description:  https://leetcode-cn.com/problems/reverse-integer/description/
+// description: https://leetcode-cn.com/problems/reverse-integer/description/
 // 反转整数
 
 /**