2016年1月13日
Linked List Cycle && Linked List Cycle II
摘要： Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Note:Do not modify the linked list.Follow up:Can you sol... 阅读全文
posted @ 2016-01-13 20:55 sdlwlxf 阅读(171) 评论(0) 推荐(0)
Simplify Path leetcode
摘要： Given an absolute path for a file (Unix-style), simplify it.For example,path="/home/", =>"/home"path="/a/./b/../../c/", =>"/c"click to show corner cas... 阅读全文
posted @ 2016-01-13 19:40 sdlwlxf 阅读(123) 评论(0) 推荐(0)
Pow(x, n) leetcode
摘要： Implement pow(x,n).Subscribeto see which companies asked this question利用依次消去二进制位上的1，来进行计算double myPow(double x, int n) { double ans = 1; unsigne... 阅读全文
posted @ 2016-01-13 13:36 sdlwlxf 阅读(119) 评论(0) 推荐(0)