text2-22.htm

来自「浙江大学计算机学院数据结构课程的教学课件」· HTM 代码 · 共 46 行

HTM
46
字号
<html>
<head>
<title>Untitled Document</title>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
</head>

<body bgcolor="#FFFFFF" link="#0000FF" vlink="#3399FF" alink="#FF0066">
<div id="Layer1" style="position:absolute; width:711px; height:21px; z-index:1; top: 10px; background-color: #CCCCCC; layer-background-color: #CCCCCC; border: 1px none #000000; left: 26px"><b>|</b><font face="宋体" size="2"><a href="../text1/text1-0.htm">第一章</a></font><b>|</b><font face="宋体" size="2">第二章</font><b>|</b><font face="宋体" size="2"><a href="../text3/text3-0.htm">第三章</a></font><b>|</b><font face="宋体" size="2"><a href="../text4/text4-0.htm">第四章</a></font><b>|</b><font face="宋体" size="2"><a href="../text5/text5-0.htm">第五章</a></font><b>|</b><font face="宋体" size="2"><a href="../text6/text6-0.htm">第六章</a></font><b>|</b><font face="宋体" size="2"><a href="../text7/text7-0.htm">第七章</a></font><b>|</b><font face="宋体" size="2"><a href="../text8/text8-0.htm">第八章</a></font><b>|</b><font face="宋体" size="2"><a href="../text9/text9-0.htm">第九章</a></font><b>|</b><font face="宋体" size="2"><a href="../text10/text10-0.htm">第十章</a></font><b>|</b><font size="2" face="宋体"><a href="../textA/textA-0.htm">算法分析</a><b><font color="#000000">|</font></b> 
  </font></div>
<pre align="left"><b><font face="Arial" size="4">
〖<font color="#0033CC">xample</font>〗<font color="#FF0033">Pattern  Matching</font>

char pat [<font size="3">MAX_SIZE</font>],  string [<font size="3">MAX_SIZE</font>],  *t

    if ( t =  (strstr( string, pat ))                  <i><font color="#FF0033"> O(n *m)</font></i>
        printf ( "The string from strstr  is  :  % s \n", t);
        else
        printf (" The pattern was not found with  strstr \ n ");

int  <font color="#FF0033">nfind</font> ( char  *string,  char  *pat )
{  <i><font size="3" color="#CC0099" face="Arial, Helvetica, sans-serif"> /* match the last character of patter first, and then match from 
	the   beginning  */</font></i>
    int  i, j, start  = 0;
    int  lasts = strlen (string ) -1;
    int  lastp =  strlen ( pat) -1 ;
    int  endmatch =  lastp;
    FOR ( i = 0; endmatch < =  lasts;  endmatch++,  start++)  {
        if ( string [endmatch ] == pat [lastp ])
               for ( j = 0, i = start;  j <  lastp && string [ i ] ==pat [ j ];  i++, j++)
                ;
    if ( j == lastp )
       return start;   <i><font face="Arial, Helvetica, sans-serif" size="3" color="#CC0099"> /*successful  */</font></i>
    }
    return  -1;
}
<img src="IMAGE/text2-22.gif" width="413" height="76">
</font></b></pre>
<table width="731" cellspacing="0" cellpadding="0">
  <tr> 
    <td width="327">&nbsp;</td>
    <td width="271"><a href="../index.htm"><img width="60" height="25" usemap="#MapMap4" border="0" src="../../images/home.gif"></a><a href="../index.htm"><map name="MapMap4"><area shape="rect" coords="42,-34,88,-15" href="text0.htm"><area shape="rect" coords="4,4,55,23" href="text2-index.htm"></map></a></td>
    <td width="131"><font face="楷体_GB2312" size="2"><b><a href="text2-21.htm">上一页</a> 
      <a href="text2-23.htm">下一页</a> </b></font></td>
  </tr>
</table>

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?