大约有 18,144 项符合查询结果（耗时：0.0199秒） [XML]
Ukkonen's suffix tree algorithm in plain English
...
7 Answers
7
Active
...
Maximum single-sell profit
Suppose we are given an array of n integers representing stock prices on a single day. We want to find a pair (buyDay, sellDay) , with buyDay ≤ sellDay , such that if we bought the stock on buyDay and sold it on sellDay , we would maximize our profit.
...
How to generate a random string of a fixed length in Go?
I want a random string of characters only (uppercase or lowercase), no numbers, in Go. What is the fastest and simplest way to do this?
...
What would cause an algorithm to have O(log n) complexity?
...
6 Answers
6
Active
...
How can we match a^n b^n with Java regex?
...
3 Answers
3
Active
...
What does “coalgebra” mean in the context of programming?
...
4 Answers
4
Active
...
Why is “except: pass” a bad programming practice?
...
16 Answers
16
Active
...
Using @property versus getters and setters
...
13 Answers
13
Active
...