摘要：
A. Point on Spiral傻逼题B. BooksTwo-PointerC. Ladder做法就是标号，详见代码：for (int i = 2; i <= n; i++) { if (a[i] <= a[i - 1]) l[i] = l[i - 1]; else l[i] = i;}for (int i = n - 1; i > 0; i--) { if (a[i] <= a[i + 1]) r[i] = r[i + 1]; else r[i] = i;}然后判断r[left]是否大于l[right]就行了... 阅读全文
