状态机学习(一)统计字符
题目来自<系统程序员成长计划>
作者:李先静.
逐个字符扫描 根据是否为字母决定当前状态 由单词内状态切换到单词外 计数字符加1
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 | #include <iostream> #include <string> #include <vector> using namespace std; string testString = " this's a test,'Hello World!!!' Welcome to the real world, it sucks, but you are gona love it!!!" ; enum STATE { STAT_INIT, STAT_IN_WORD, STAT_OUT_WORD }; size_t CountWords( const string& s) { int count = 0; STATE state = STAT_INIT; for ( size_t i = 0; i < s.size(); i++) { switch (state) { case STAT_INIT: if ( isalpha (s[i])) { state = STAT_IN_WORD; } else { state = STAT_OUT_WORD; } break ; case STAT_IN_WORD: if ( isalpha (s[i])) { state = STAT_IN_WORD; } else { count++; state = STAT_OUT_WORD; } break ; case STAT_OUT_WORD: if ( isalpha (s[i])) { state = STAT_IN_WORD; } else { state = STAT_OUT_WORD; } break ; default : break ; } //switch (state) } if (STAT_IN_WORD == state) { count++; } return count; } int main() { cout << CountWords(testString) << endl; return 0; } |
改进版 计数以外还讲单词放入容器
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 | #include <iostream> #include <string> #include <vector> using namespace std; string testString = " this's a test,'Hello World!!!' Welcome to the real world, it sucks, but you are gona love it!!!" ; enum STATE { STAT_INIT, STAT_IN_WORD, STAT_OUT_WORD }; size_t CountWords( const string& s) { int count = 0; STATE state = STAT_INIT; for ( size_t i = 0; i < s.size(); i++) { switch (state) { case STAT_INIT: if ( isalpha (s[i])) { state = STAT_IN_WORD; } else { state = STAT_OUT_WORD; } break ; case STAT_IN_WORD: if ( isalpha (s[i])) { state = STAT_IN_WORD; } else { count++; state = STAT_OUT_WORD; } break ; case STAT_OUT_WORD: if ( isalpha (s[i])) { state = STAT_IN_WORD; } else { state = STAT_OUT_WORD; } break ; default : break ; } //switch (state) } if (STAT_IN_WORD == state) { count++; } return count; } size_t word_segmentation( const string& s, vector<string>& strVec) { STATE state = STAT_INIT; size_t count = 0; size_t subStrStart = string::npos; size_t subStrEnd = string::npos; for ( size_t i = 0; i < s.size(); i++) { switch (state) { case STAT_INIT: if ( isalpha (s[i])) { subStrStart = i; state = STAT_IN_WORD; } break ; case STAT_IN_WORD: if (! isalpha (s[i])){ count++; subStrEnd = i; strVec.push_back(s.substr(subStrStart, subStrEnd- subStrStart)); state = STAT_OUT_WORD; } break ; case STAT_OUT_WORD: if ( isalpha (s[i])) { subStrStart = i; state = STAT_IN_WORD; } break ; default : break ; } //switch (state) } if (state == STAT_IN_WORD) { count++; subStrEnd = s.size(); strVec.push_back(s.substr(subStrStart, subStrEnd- subStrStart)); } return count; } int main() { cout << CountWords(testString) << endl; vector<string> strVec; cout << word_segmentation(testString, strVec) << endl; for (vector<string>::iterator it = strVec.begin(); it != strVec.end(); it++) { cout << *it << " " ; } cout << endl; return 0; } |
运行结果
19
19
this s a test Hello World Welcome to the real world it sucks but y
ou are gona love it
请按任意键继续. . .
作 者: itdef
欢迎转帖 请保持文本完整并注明出处
技术博客 http://www.cnblogs.com/itdef/
B站算法视频题解
https://space.bilibili.com/18508846
qq 151435887
gitee https://gitee.com/def/
欢迎c c++ 算法爱好者 windows驱动爱好者 服务器程序员沟通交流
如果觉得不错,欢迎点赞,你的鼓励就是我的动力
欢迎转帖 请保持文本完整并注明出处
技术博客 http://www.cnblogs.com/itdef/
B站算法视频题解
https://space.bilibili.com/18508846
qq 151435887
gitee https://gitee.com/def/
欢迎c c++ 算法爱好者 windows驱动爱好者 服务器程序员沟通交流
如果觉得不错,欢迎点赞,你的鼓励就是我的动力


【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· 分享一个免费、快速、无限量使用的满血 DeepSeek R1 模型,支持深度思考和联网搜索!
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· ollama系列1:轻松3步本地部署deepseek,普通电脑可用
· 按钮权限的设计及实现
· 25岁的心里话