二分
文章平均质量分 64
益达915
一名在读大学生,渣渣一枚,进取中...
展开
-
LeetCode | Pow(x, n)
二分求幂,还是觉得非递归形式好理解一点。 然后就是有几个n=INT_MIN的用例,以及1、-1的用例。这种需要特判一下~class Solution { public: double myPow(double x, int n) { if(x-1==0) return 1; if(x+1==0) return n%2==0?1:-1; if(原创 2016-08-19 17:15:34 · 253 阅读 · 0 评论 -
LeetCode | Sqrt(x)
简直蛋疼的一道题目…class Solution { public: int mySqrt(int x) { int left=1,right=x/2; int mid; if(x<2) return x; while(left<=right){ int midV=(left+right)/2;原创 2016-08-19 17:35:43 · 239 阅读 · 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 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate exists in the array.这道题显然原创 2016-08-22 23:40:19 · 197 阅读 · 0 评论 -
LeetCode | Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great / \ gr原创 2016-08-26 15:40:18 · 501 阅读 · 0 评论