本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss
摘要: 题目链接Implement pow(x, n).主要利用x^2n = (x^n)*(x^n), x^2n+1 = (x^n)*(x^n)*x注意n是负数,对其取反时,可能会溢出其实0^0(都是整数)是未定义的,因为0^0 = 0^1 / 0^1 = 0 / 0, 0作为除数是未定义的,可以参考维基百... 阅读全文
posted @ 2014-06-22 20:11 tenos 阅读(1019) 评论(0) 推荐(0) 编辑
摘要: Combination Sum Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C u... 阅读全文
posted @ 2014-06-22 15:49 tenos 阅读(1583) 评论(0) 推荐(1) 编辑

本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss

公益页面-寻找遗失儿童