LeetCode Integer to Roman
class Solution { private: const static char* pattern[]; const static char* roman_digit[]; public: string intToRoman(int num) { if (num < 1 || num > 3999) return ""; string res(""); int i=0; while (num) { res = getSingleRomanDigit(num % 10, i++) + res; num /= 10; } return res; } string getSingleRomanDigit(int digit, int mag) { if (digit == 0) return ""; if (digit > 9 || digit < 1 || mag > 3 || mag < 0) { return "FORMAT ERROR"; } string res; int pi = 0; for (int i=0; (pi = pattern[digit][i]) != '\0'; i++) { pi = pi - '0'; res.push_back(roman_digit[mag][pi]); } return res; } }; const char* Solution::pattern[] = {"x", "0", "00", "000", "01", "1", "10", "100", "1000", "02"}; const char* Solution::roman_digit[] = {"IVX", "XLC", "CDM", "M"};
水一发
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步