2016年9月14日
[LeetCode] Integer Replacement 整数替换
摘要： Given a positive integer n and you can do operations as follow: What is the minimum number of replacements needed for n to become 1? Example 1: Exampl 阅读全文
posted @ 2016-09-14 20:57 Grandyang 阅读(9220) 评论(6) 推荐(0)
Fork me on GitHub