We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 62013a9 commit cfe1a23Copy full SHA for cfe1a23
problems/121. Best Time to Buy and Sell Stock/README.md
@@ -2,7 +2,7 @@
2
3
我们需要在数组中,查找到两个数值的最大差值,而且需要满足第二个数值大于第一个数值。我们可以形式化为如下的数学表达式:
4
5
-$max(prices[j] - prices[i]), for every i and j such that j > i$
+$\text{max(prices[j] - prices[i]), for every i and j such that j > i}$
6
7
## #1 暴力求解法 [TLE]
8
0 commit comments