转载：字串查找代码

最新推荐文章于 2023-12-12 08:45:36 发布

七斗星

最新推荐文章于 2023-12-12 08:45:36 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：编程碎片

本文链接：https://blog.youkuaiyun.com/jchen1218/article/details/12948173

编程碎片专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个使用字符数组进行字符匹配的示例程序。通过两个不同的 while 循环，程序展示了如何遍历缓冲区中的字符，并利用预定义的字符数组来进行条件判断。此示例有助于理解字符数组在实际编程中的运用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

char* dtmfc = "1234567890ABCDEF" ;
char* dtmfc1 ;

:
:
:

while(*buf)
{
c = *buf++ ;
dtmfc1 = dtmfc ;
while( *dtmfc1)
{
  if( *demfc1 == c )
   ......
  else
   ......
  dtmfc1 ++ ;
}
}
:
:
:

再看：
const char dtmfc[256] = {

0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* ctrl char */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* ctrl char */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /*  -------/ */
1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0, /* 0-------? */
0,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0, /* @-------O */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* P-------_ */
0,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0, /* '-------0 */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* p-------  */
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,

}
:
:
:

while( *buf )
{
c = *buf++ ;
if( dtmfc[c] == 1 )
  ......
else
  ......
}

怎么杨，这个数组的作用大吧？！