摘要:
Implement pow(x, n). double sum = 1; if (n > 0) { while ((n--) > 0) sum *= x; return sum; } else if (n < 0) { while ((n++) < 0) sum /= x; } return sum 阅读全文
posted @ 2016-01-27 16:31 cKK 阅读(243) 评论(0) 推荐(0)
|
||
|
摘要:
Implement pow(x, n). double sum = 1; if (n > 0) { while ((n--) > 0) sum *= x; return sum; } else if (n < 0) { while ((n++) < 0) sum /= x; } return sum 阅读全文
posted @ 2016-01-27 16:31 cKK 阅读(243) 评论(0) 推荐(0)
摘要:
Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the correct ... 阅读全文
posted @ 2016-01-27 13:16 cKK 阅读(196) 评论(0) 推荐(0) |
||