8000 Update README.md · Mowmowj/leetcode@cfe1a23 · GitHub
[go: up one dir, main page]
Skip to content

Commit cfe1a23

Browse files
feiyutalkfeiyutalk
authored
Update README.md
1 parent 62013a9 commit cfe1a23

File tree

1 file changed

+1
-1
lines changed
  • problems/121. Best Time to Buy and Sell Stock

1 file changed

+1
-1
lines changed

‎problems/121. Best Time to Buy and Sell Stock/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
我们需要在数组中，查找到两个数值的最大差值，而且需要满足第二个数值大于第一个数值。我们可以形式化为如下的数学表达式:
44

5-
$max(prices[j] - prices[i]), for every i and j such that j > i$
5+
$\text{max(prices[j] - prices[i]), for every i and j such that j > i}$
66

77
## #1 暴力求解法 [TLE]
88

0 commit comments

Comments
 (0)
0