08 2015 档案

[leetcode] Palindrome Number
摘要：题目：Determine whether an integer is a palindrome. Do this without extra space.解题思路：循环取得首位和末尾，然后比较。解题心得：关于整数的处理有几个 运算需要熟记：一个整数：%10 得个位 ， %100 的后两位 就是个位和... 阅读全文
posted @ 2015-08-19 09:47 fengmang 阅读(92) 评论(0) 推荐(0) 编辑
[leetcode] Find Minimum in Rotated Sorted Array
摘要：题目：Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.Yo... 阅读全文
posted @ 2015-08-19 08:10 fengmang 阅读(174) 评论(0) 推荐(0) 编辑