feat: update solutions to lc and lcof problems

Author: yanglbme

lcof/面试题42. 连续子数组的最大和/README.md

@@ -65,17 +65,51 @@ class Solution {
  * @return {number}
  */
 var maxSubArray = function (nums) {
-  if (!nums || !nums.length) return null;
-  let len = nums.length;
-  let dp = new Array(len);
-  dp[0] = nums[0];
-  for (let i = 1; i < len; i++) {
-    dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
+  let res = nums[0];
+  let f = nums[0];
+  for (let i = 1; i < nums.length; ++i) {
+    f = Math.max(f, 0) + nums[i];
+    res = Math.max(res, f);
   }
-  return Math.max(...dp);
+  return res;
 };
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        int res = nums[0], f = nums[0];
+        for (int i = 1; i < nums.size(); ++i) {
+            f = max(f, 0) + nums[i];
+            res = max(res, f);
+        }
+        return res;
+    }
+};
+```
+
+### **Go**
+
+```go
+func maxSubArray(nums []int) int {
+    f, res := nums[0], nums[0]
+    for i := 1; i < len(nums); i++ {
+        if f > 0 {
+            f += nums[i]
+        } else {
+            f = nums[i]
+        }
+        if f > res {
+            res = f
+        }
+    }
+    return res
+}
+```
+
 ### **...**
 
 ```

lcof/面试题42. 连续子数组的最大和/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        int res = nums[0], f = nums[0];
+        for (int i = 1; i < nums.size(); ++i) {
+            f = max(f, 0) + nums[i];
+            res = max(res, f);
+        }
+        return res;
+    }
+};

lcof/面试题42. 连续子数组的最大和/Solution.go

@@ -0,0 +1,14 @@
+func maxSubArray(nums []int) int {
+    f, res := nums[0], nums[0]
+    for i := 1; i < len(nums); i++ {
+        if f > 0 {
+            f += nums[i]
+        } else {
+            f = nums[i]
+        }
+        if f > res {
+            res = f
+        }
+    }
+    return res
+}

lcof/面试题42. 连续子数组的最大和/Solution.js

@@ -3,12 +3,11 @@
  * @return {number}
  */
 var maxSubArray = function (nums) {
-  if (!nums || !nums.length) return null;
-  let len = nums.length;
-  let dp = new Array(len);
-  dp[0] = nums[0];
-  for (let i = 1; i < len; i++) {
-    dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
+  let res = nums[0];
+  let f = nums[0];
+  for (let i = 1; i < nums.length; ++i) {
+    f = Math.max(f, 0) + nums[i];
+    res = Math.max(res, f);
   }
-  return Math.max(...dp);
+  return res;
 };

solution/0100-0199/0121.Best Time to Buy and Sell Stock/README.md

@@ -86,7 +86,11 @@ class Solution {
 ### **JavaScript**
 
 ```js
-const maxProfit1 = function (prices) {
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+const maxProfit = function (prices) {
   let min = prices[0];
   let profit = 0;
   for (let i = 0; i < prices.length; i++) {

solution/0100-0199/0121.Best Time to Buy and Sell Stock/README_EN.md

@@ -76,7 +76,11 @@ class Solution {
 ### **JavaScript**
 
 ```js
-const maxProfit1 = function (prices) {
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+const maxProfit = function (prices) {
   let min = prices[0];
   let profit = 0;
   for (let i = 0; i < prices.length; i++) {

solution/0100-0199/0121.Best Time to Buy and Sell Stock/Solution.js

@@ -1,4 +1,8 @@
-const maxProfit1 = function (prices) {
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+const maxProfit = function (prices) {
   let min = prices[0];
   let profit = 0;
   for (let i = 0; i < prices.length; i++) {