摘要： Given two strings S and T, determine if they are both one edit distance apart. 给定两个字符串，判断他们是否是一步变换得到的。 在这里需要注意几点： 1、不等于1的变换都要返回false（包括变换次数等于0)。 2、还有很 阅读全文

摘要： Given a string, find the length of the longest substring T that contains at most 2 distinct characters. For example, Given s = “eceba”, T is "ece" whi 阅读全文

摘要： The API: int read4(char *buf) reads 4 characters at a time from a file. The return value is the actual number of characters read. For example, it retu 阅读全文

摘要： The API: int read4(char *buf) reads 4 characters at a time from a file. The return value is the actual number of characters read. For example, it retu 阅读全文

摘要： 156. Binary Tree Upside Down Add to List QuestionEditorial Solution My Submissions 156. Binary Tree Upside Down Add to List QuestionEditorial Solution 阅读全文