摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height balanced bina 阅读全文

摘要： Given a string, find the length of the longest substring without repeating characters. 思路：用map维护区间内各个字母的数量，然后遇到已经访问过的就进行滑动区间，来得到符合条件的区间，然后求最大区间长度。 虽然时 阅读全文