01 2016 档案

leetcode 总结part1
摘要：从十月份开始到现在，差不多近3个月时间吧。中间有的时候有事没有办法刷题，也有的题目比较难，比较麻烦，会浪费很多时间，71道题，也都是简单的。下图是最后20道刷题的记录吧。完成自己的目标是轻松的。之后会减慢刷题的节奏，也要做做总结。毕竟还有别的事情要做。 阅读全文
posted @ 2016-01-05 17:38 0giant 阅读(209) 评论(0) 推荐(0) 编辑
leetcode String to Integer (atoi)
摘要：Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below a... 阅读全文
posted @ 2016-01-05 17:20 0giant 阅读(271) 评论(0) 推荐(0) 编辑
leetcode 165. Compare Version Numbers
摘要：Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 val2) return 1;20 if(val1<val2) return -1;... 阅读全文
posted @ 2016-01-04 23:04 0giant 阅读(208) 评论(0) 推荐(0) 编辑
leetcode 189. Rotate Array
摘要：Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].首先题意理... 阅读全文
posted @ 2016-01-04 17:30 0giant 阅读(153) 评论(0) 推荐(0) 编辑
leetcode 168. Excel Sheet Column Title
摘要：Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 ->... 阅读全文
posted @ 2016-01-04 16:19 0giant 阅读(142) 评论(0) 推荐(0) 编辑
leetcode 155. Min Stack
摘要：Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文
posted @ 2016-01-04 14:24 0giant 阅读(181) 评论(0) 推荐(0) 编辑
leetcode 228. Summary Ranges
摘要：Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].Credits... 阅读全文
posted @ 2016-01-04 10:53 0giant 阅读(331) 评论(0) 推荐(0) 编辑