1 class Solution { 2 public: 3 int largestPalindrome(int n) 4 { 5 vector<int> res{9,987,123,597,677,1218,877,475}; 6 return res[n-1]; 7 } 8 };
这里的穷举法,你不得不服
1 class Solution { 2 public: 3 int largestPalindrome(int n) 4 { 5 vector<int> res{9,987,123,597,677,1218,877,475}; 6 return res[n-1]; 7 } 8 };
这里的穷举法,你不得不服