摘要：
https://blog.csdn.net/u014182497/article/details/82252456 http://fangs.in/post/thinkstats/likelihood/ 阅读全文
摘要：
in_ = [8,2,5,4,3,9,7,2,5] def right_num(in_): stack = [0] res = [-1]*len(in_) i = 1 while i<len(in_): if stack and in_[i] > in_[stack[-1]]: res[stack. 阅读全文