-
Notifications
You must be signed in to change notification settings - Fork 46
Pull requests: keep-practicing/leetcode-go
Pull requests list
122. Best Time to Buy and Sell Stock II
array
An array is stored such that the position of each element can be computed from its index
Easy
Coefficient of difficulty easy
Greedy algorithm
making the locally optimal choice at each stage with the intent of finding the global optimum.
#22
by zwfang
was merged Dec 29, 2018
Loading...
ProTip!
Add no:assignee to see everything that’s not assigned.