Leetcode 38. Count and Say | | Leetcode 38. Count and Say 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution123456789101112131415161718192021222324252627282930313233class Solution {public: string countAndSay(int n) { if(n == 1) { return "1"; } string result; string current = "1"; for(int i = 1; i < n; i++) { result = statistic(current); current = result; } return result; }private: string statistic(string s) { string result; int count = 1; char current = s[0]; for(int i = 1; i < s.length(); i++) { if(current == s[i]) { count++; } else { result = result + to_string(count) + current; current = s[i]; count = 1; } } return result + to_string(count) + current; }}; Reference https://leetcode.com/problems/count-and-say/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏