2014年7月4日
leetcode--Sqrt(x)
摘要： Implementint sqrt(int x).Compute and return the square root ofx.public class Solution { public int sqrt(int x) { if(x < 0) return -1; if(x =... 阅读全文
posted @ 2014-07-04 22:51 Averill Zheng 阅读(179) 评论(0) 推荐(0) 编辑
leetcode--Word Ladder II
摘要： Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, such that:Only one letter can be changed... 阅读全文
posted @ 2014-07-04 20:40 Averill Zheng 阅读(159) 评论(0) 推荐(0) 编辑
leetcode--Word Ladder
摘要： Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoend, such that:Only one letter can be ... 阅读全文
posted @ 2014-07-04 02:47 Averill Zheng 阅读(156) 评论(0) 推荐(0) 编辑