알고리즘/codefights

2>largestNumber

Diademata 2018. 5. 19. 23:13
반응형

Given an integer n, return the largest number that contains exactly n digits.


Example


For n = 2, the output should be

largestNumber(n) = 99. 


code>>


int largestNumber(int n) {

return std::pow(10, n) - 1;

}

반응형