学步园

A字符串反转

#include <cstdio><br /> #include <cstdlib><br /> #include <string><br /> /*string reverse:<br /> input:hello world<br /> output:world hello<br /> 思想：将字符串全部反转后再以空格为标志，将局部字符串再反转<br /> */<br /> int main(void)<br /> {<br /> void string_reverse(char *str,int len);<br /> void word_reverse(char* str);<br /> char str[] = "hello world";<br /> word_reverse(str);<br /> printf("%s/n",str);</p> <p> return 0;<br /> }</p> <p>void string_reverse(char *str,int len)<br /> {<br /> char *head = str;<br /> char *tail = str + len - 1;<br /> char temp;<br /> for(;head<tail;head++,tail--)<br /> {<br /> temp = *head;<br /> *head = *tail;<br /> *tail = temp;<br /> }<br /> }<br /> void word_reverse(char *str)<br /> {<br /> char *p = str;<br /> int word_len = 0;<br /> int len = strlen(str);<br /> string_reverse(str,len);<br /> printf("%s/n",str);<br /> while(*p != '/0')<br /> {<br /> word_len++;<br /> p++;<br /> if(*p == ' ' || *p == '/0')<br /> {<br /> string_reverse(p-word_len,word_len);<br /> word_len = -1;//-1是因为p指向的这个当前的空格会当做下个单词的一个字符<br /> }<br /> }<br /> }</p> <p>

B计算字符串间的编辑距离。

编辑距离：给定两个字符串S1和S2，它们间的edit distace指将S1装换为S2所需的最小编辑操作次数。编辑操作指：插入一个字符、删除一个字符、替换一个字符。

#include <cstdio><br /> #include <cstdlib><br /> #include <string.h><br /> #include <vector><br /> using namespace std;<br /> int main(void)<br /> {<br /> int EditDistance(char *s1,char *s2);<br /> int minimal(int a,int b,int c);<br /> char s1[] = "cats",s2[] = "fast";<br /> int d = EditDistance(s1,s2);<br /> printf("The edit distance between %s and %s is %d/n",s1,s2,d);</p> <p> return 0;</p> <p>}</p> <p>int minimal(int a,int b,int c)<br /> {<br /> int t = (a < b ? a : b);<br /> return t < c ? t : c;<br /> }<br /> int EditDistance(char *s1,char *s2)<br /> {<br /> int m = strlen(s1) ,n = strlen(s2),i,j,temp;<br /> vector<vector<int> > Array;<br /> Array.resize(m+1);<br /> for(i = 0;i <= m;i++)<br /> Array[i].resize(n+1);</p> <p> for(i = 0;i <= m;i++)<br /> Array[i][0] = i;<br /> for(j = 0;j <= n;j++)<br /> Array[0][j] = j;</p> <p> for(i = 1;i <= m;i++)<br /> for(j = 1;j <= n;j++)<br /> {<br /> temp = Array[i -1][j - 1] + (s1[i - 1] == s2[j - 1] ? 0 : 1 );<br /> Array[i][j] = minimal(temp,Array[i-1][j] + 1,Array[i][j - 1] + 1);<br /> }</p> <p> return Array[m][n];<br /> }<br />

 C约瑟夫环的实现（修改百度知道程序）

#include<cstdio><br /> #include<cstdlib></p> <p>struct LNode<br /> {<br /> int data;<br /> LNode* link;<br /> };<br /> typedef LNode* LinkList;</p> <p>void JOSEPHUS (int n, int k, int m)<br /> {<br /> LinkList p, r, list = NULL;<br /> for (int i = 0;i < n;i++)<br /> {<br /> p = (LinkList) malloc (sizeof (LNode));<br /> p->data = i;<br /> if (list == NULL)<br /> list = p;<br /> else<br /> r->link = p;<br /> r = p;<br /> }<br /> p->link = list;<br /> p = list;<br /> for (i = 0; i < k; i++)<br /> {<br /> r = p;<br /> p = p->link;<br /> }<br /> while (p->link != p)<br /> {<br /> for (i = 0; i < m - 1; i++)<br /> {<br /> r = p;<br /> p = p->link;<br /> }<br /> r->link = p->link;<br /> printf ("%4d ", p->data);<br /> free (p);<br /> p = r->link;<br /> }<br /> printf("%4d",r->data);<br /> }</p> <p>int main(void)<br /> {<br /> JOSEPHUS(10,0,2);<br /> return 0;<br /> }<br />