Merge branch 'master' of https://github.com/azl397985856/leetcode

Author: lucifer

problems/121.best-time-to-buy-and-sell-stock.md

@@ -45,47 +45,6 @@ Explanation: In this case, no transaction is done, i.e. max profit = 0.
 JS Code:
 
 ```js
-/*
- * @lc app=leetcode id=121 lang=javascript
- *
- * [121] Best Time to Buy and Sell Stock
- *
- * https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/
- *
- * algorithms
- * Easy (46.34%)
- * Total Accepted:    480.5K
- * Total Submissions: 1M
- * Testcase Example:  '[7,1,5,3,6,4]'
- *
- * Say you have an array for which the i^th element is the price of a given
- * stock on day i.
- *
- * If you were only permitted to complete at most one transaction (i.e., buy
- * one and sell one share of the stock), design an algorithm to find the
- * maximum profit.
- *
- * Note that you cannot sell a stock before you buy one.
- *
- * Example 1:
- *
- *
- * Input: [7,1,5,3,6,4]
- * Output: 5
- * Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit
- * = 6-1 = 5.
- * Not 7-1 = 6, as selling price needs to be larger than buying price.
- *
- *
- * Example 2:
- *
- *
- * Input: [7,6,4,3,1]
- * Output: 0
- * Explanation: In this case, no transaction is done, i.e. max profit = 0.
- *
- *
- */
 /**
  * @param {number[]} prices
  * @return {number}

problems/122.best-time-to-buy-and-sell-stock-ii.md

@@ -54,62 +54,6 @@ Explanation: In this case, no transaction is done, i.e. max profit = 0.
 JS Code:
 
 ```js
-
-/*
- * @lc app=leetcode id=122 lang=javascript
- *
- * [122] Best Time to Buy and Sell Stock II
- *
- * https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/
- *
- * algorithms
- * Easy (50.99%)
- * Total Accepted:    315.5K
- * Total Submissions: 610.9K
- * Testcase Example:  '[7,1,5,3,6,4]'
- *
- * Say you have an array for which the i^th element is the price of a given
- * stock on day i.
- * 
- * Design an algorithm to find the maximum profit. You may complete as many
- * transactions as you like (i.e., buy one and sell one share of the stock
- * multiple times).
- * 
- * Note: You may not engage in multiple transactions at the same time (i.e.,
- * you must sell the stock before you buy again).
- * 
- * Example 1:
- * 
- * 
- * Input: [7,1,5,3,6,4]
- * Output: 7
- * Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit
- * = 5-1 = 4.
- * Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 =
- * 3.
- * 
- * 
- * Example 2:
- * 
- * 
- * Input: [1,2,3,4,5]
- * Output: 4
- * Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit
- * = 5-1 = 4.
- * Note that you cannot buy on day 1, buy on day 2 and sell them later, as you
- * are
- * engaging multiple transactions at the same time. You must sell before buying
- * again.
- * 
- * 
- * Example 3:
- * 
- * 
- * Input: [7,6,4,3,1]
- * Output: 0
- * Explanation: In this case, no transaction is done, i.e. max profit = 0.
- * 
- */
 /**
  * @param {number[]} prices
  * @return {number}
@@ -137,7 +81,6 @@ class Solution:
         gains = [prices[i] - prices[i-1] for i in range(1, len(prices))
                  if prices[i] - prices[i-1] > 0]
         return sum(gains)
-print(Solution().maxProfit([7, 1, 5, 3, 6, 4]))
 #评论区里都讲这是一道开玩笑的送分题.
 ```
 

problems/877.stone-game.md

@@ -64,65 +64,6 @@ sum(piles) is odd.
 ## 代码
 
 ```js
-/*
- * @lc app=leetcode id=877 lang=javascript
- *
- * [877] Stone Game
- *
- * https://leetcode.com/problems/stone-game/description/
- *
- * algorithms
- * Medium (60.46%)
- * Total Accepted:    21.4K
- * Total Submissions: 35.3K
- * Testcase Example:  '[5,3,4,5]'
- *
- * Alex and Lee play a game with piles of stones.  There are an even number of
- * piles arranged in a row, and each pile has a positive integer number of
- * stones piles[i].
- *
- * The objective of the game is to end with the most stones.  The total number
- * of stones is odd, so there are no ties.
- *
- * Alex and Lee take turns, with Alex starting first.  Each turn, a player
- * takes the entire pile of stones from either the beginning or the end of the
- * row.  This continues until there are no more piles left, at which point the
- * person with the most stones wins.
- *
- * Assuming Alex and Lee play optimally, return True if and only if Alex wins
- * the game.
- *
- *
- *
- * Example 1:
- *
- *
- * Input: [5,3,4,5]
- * Output: true
- * Explanation:
- * Alex starts first, and can only take the first 5 or the last 5.
- * Say he takes the first 5, so that the row becomes [3, 4, 5].
- * If Lee takes 3, then the board is [4, 5], and Alex takes 5 to win with 10
- * points.
- * If Lee takes the last 5, then the board is [3, 4], and Alex takes 4 to win
- * with 9 points.
- * This demonstrated that taking the first 5 was a winning move for Alex, so we
- * return true.
- *
- *
- *
- *
- * Note:
- *
- *
- * 2 <= piles.length <= 500
- * piles.length is even.
- * 1 <= piles[i] <= 500
- * sum(piles) is odd.
- *
- *
- *
- */
 /**
  * @param {number[]} piles
  * @return {boolean}