exercises 2-4
来源:互联网 发布:p.cn云计算门户 编辑:程序博客网 时间:2024/05/16 03:44
#include <stdio.h>void squeeze(char s1[],char s2[]);int main(int argc, char *argv[]){ char s1[]="2819whatevfr"; char s2[]="238wvfr"; squeeze(s1,s2); printf("after processed:\n%s\n",s1); return 0;}void squeeze(char s1[],char s2[]){ enum boolean {NO,YES}; int i,j,k; k=0; for(i=0; s1[i]!='\0'; i++) { enum boolean found=NO; for(j=0; s2[j]!='\0'; j++) { if(s1[i]==s2[j]) { found=YES; } } if(found==NO) { s1[k]=s1[i]; k++; } } s1[k]='\0';}
- exercises 2-4
- Exercises 4-4
- Exercises 2-2
- Exercises 3-4
- Exercises 4-1
- Exercises 4-3
- Exercises 4-6
- Exercises 4-11
- Exercises 4-12
- Exercises 4-13
- Exercises 4-14
- exercises 2-3
- Exercises 2-5
- Exercises 2-8
- Exercises 2-7
- Exercises 2-6
- Exercises 2-10
- Exercises 2-9
- ip处理工具类IPUtil
- 老鸟对菜鸟的一些建议
- 软件项目管理的十大定律
- java中memcached基本使用方法
- VC++编译选项
- exercises 2-4
- CountDownLatch同步工具类
- IPHONE手机知识大全(中)
- 一个简单的C#消息队列示例
- NFS网络文件系统搭建
- apache 添加虚拟主机
- 算法系列之十二:多边形区域填充算法--改进的扫描线填充算法
- Android Layout XML属性研究--android:layout_marginBottom
- C#实现消息队列MSMQ