codingEskimo

摘要： This question is very hard, just remember it:Explaination: 思路清晰，就是二倍法。直接用除数去一个一个加，直到被除数被超过的话，会超时。解决办法每次将被除数增加1倍，同时将count也增加一倍，如果超过了被除数，那么用被除数减去当前和再继续本 阅读全文

摘要： Important Node: 1) This problem has two parts: a. find the closest number's to the target and return its index. This is standard binary search problem 阅读全文