leetcode

0 class Solution {

1 public:

2 string largestGoodInteger(const string &num) const {

3 int res = -1;

4 for (int i = 0; i < num.size() - 2; i++) {

5 if (num[i] == num[i + 1] && num[i] == num[i + 2]) {

6 res = max(res, num[i] & 0x0F);

7 }

8 }

9 return res == -1 ? "" : string(3, '0' + res);

10 }

11 };