摘要： My first version brute force solution just switch the chars one by one and compare with the max value. The time complaxity is O(n2). public int maximu 阅读全文

摘要： When I got this problem, I used one Deque and one map to solve it, the solution is as following, the time complexity of get() and put() is O(n), n is 阅读全文