| | | | |

2016年11月28日

✡ leetcode 161. One Edit Distance 判断两个字符串是否是一步变换 --------- java

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

posted @ 2016-11-28 23:06 xiaoba1203 阅读(633) 评论(0) 推荐(0)

✡ leetcode 159. Longest Substring with At Most Two Distinct Characters 求两个字母组成的最大子串长度 --------- java

摘要： 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 阅读全文

posted @ 2016-11-28 17:14 xiaoba1203 阅读(385) 评论(0) 推荐(0)

✡ leetcode 158. Read N Characters Given Read4 II - Call multiple times 对一个文件多次调用read（157题的延伸题） --------- java

摘要： 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 阅读全文

posted @ 2016-11-28 15:11 xiaoba1203 阅读(344) 评论(0) 推荐(0)

✡ leetcode 157. Read N Characters Given Read4 利用read4实现read --------- java

摘要： 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 阅读全文

posted @ 2016-11-28 14:20 xiaoba1203 阅读(510) 评论(0) 推荐(0)

✡ leetcode 156. Binary Tree Upside Down 旋转树 --------- java

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

posted @ 2016-11-28 12:56 xiaoba1203 阅读(285) 评论(0) 推荐(0)

2016年11月28日

公告