摘要:
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo 阅读全文
摘要:
Given a string containing just the characters '(' and ')',find the length of the longest valid (well-formed) parentheses substring. For "(()", the lon 阅读全文
摘要:
新式类中最酷的,或者也是最不平常的特性之一,可能就是编写“cooperative类”。‘cooperative类’通过多继承,使用我称之为‘cooperative super call’的模式。 先来看一下传统的,非cooperative super call的特点:当类C继承了基类B时,C希望覆盖 阅读全文