数组字符串,企业笔试题
来源:互联网 发布:ucloud云计算 校园 编辑:程序博客网 时间:2024/04/28 03:43
1.输入整数,输出字符串
#include <stdio.h>
#include <string.h>
#include <math.h>
#define MAX_SIZE 10
int main()
{
int i;
int j;
int len;
int num = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i <= len - 1; i++)
{
j = str[i] - '0';
num = num * 10 + j;
}
printf("number is :%d\n",num);
return 0;
}
1.输入字符串 输出其中数字的个数
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int len;
int num = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i <= (len - 1); i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
num++;
}
}
printf("number is :%d\n",num);
return 0;
}
2.输入字符串,如12we23w,输出37
法一:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int j;
int len;
int sum = 0;
int num = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i < len; i++)
{
while(str[i] >= '0' && str[i] <= '9')
{
j = str[i] - '0';
num = num * 10 + j;
i++;
}
sum = sum + num;
num = 0;
}
printf("number is :%d\n",sum);
return 0;
}
法二:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int j;
int k;
int len;
int sum = 0;
int sum2 = 0;
char str[MAX_SIZE];
char str2[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
j = 0;
for(i = 0; i <= (len - 1); i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
sum = sum * 10 + (str[i] - '0');
}
else
{
sum2 = sum2 + sum;
sum = 0;
}
}
sum2 = sum2 + sum;
printf("sum is :%d\n",sum2);
return 0;
}
13.输出字符串中的最长数字子串
法一:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int j;
int len;
int temp = 0;
int max = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i < len; i++)
{
while(str[i] >= '0' && str[i] <= '9')
{
temp++;
i++;
}
if(temp >= max)
{
max = temp;
}
temp = 0;
}
printf("max size is :%d\n",max);
return 0;
}
法二:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int len;
int size;
int sum = 0;
int temp = 0;
int max = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i <= len; i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
temp++;
sum = sum * 10 + (str[i] - '0');
}
else
{
if(sum >= max)
{
max = sum;
size = temp;
}
sum = 0;
temp = 0;
}
}
printf("max size is :%d\n",size);
return 0;
}
#include <stdio.h>
#include <string.h>
#include <math.h>
#define MAX_SIZE 10
int main()
{
int i;
int j;
int len;
int num = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i <= len - 1; i++)
{
j = str[i] - '0';
num = num * 10 + j;
}
printf("number is :%d\n",num);
return 0;
}
1.输入字符串 输出其中数字的个数
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int len;
int num = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i <= (len - 1); i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
num++;
}
}
printf("number is :%d\n",num);
return 0;
}
2.输入字符串,如12we23w,输出37
法一:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int j;
int len;
int sum = 0;
int num = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i < len; i++)
{
while(str[i] >= '0' && str[i] <= '9')
{
j = str[i] - '0';
num = num * 10 + j;
i++;
}
sum = sum + num;
num = 0;
}
printf("number is :%d\n",sum);
return 0;
}
法二:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int j;
int k;
int len;
int sum = 0;
int sum2 = 0;
char str[MAX_SIZE];
char str2[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
j = 0;
for(i = 0; i <= (len - 1); i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
sum = sum * 10 + (str[i] - '0');
}
else
{
sum2 = sum2 + sum;
sum = 0;
}
}
sum2 = sum2 + sum;
printf("sum is :%d\n",sum2);
return 0;
}
13.输出字符串中的最长数字子串
法一:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int j;
int len;
int temp = 0;
int max = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i < len; i++)
{
while(str[i] >= '0' && str[i] <= '9')
{
temp++;
i++;
}
if(temp >= max)
{
max = temp;
}
temp = 0;
}
printf("max size is :%d\n",max);
return 0;
}
法二:
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 100
int main()
{
int i;
int len;
int size;
int sum = 0;
int temp = 0;
int max = 0;
char str[MAX_SIZE];
printf("please input string:\n");
gets(str);
len = strlen(str);
for(i = 0; i <= len; i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
temp++;
sum = sum * 10 + (str[i] - '0');
}
else
{
if(sum >= max)
{
max = sum;
size = temp;
}
sum = 0;
temp = 0;
}
}
printf("max size is :%d\n",size);
return 0;
}
0 0
- 数组字符串,企业笔试题
- 数组字符串类笔试题
- 程序员笔试(1)--数组和字符串
- 去哪儿笔试题:寻找字符串数组中指定字符出现的字符串并排序
- 笔试题1--数组
- 笔试题2-数组
- 刷刷笔试题~~[数组]
- 回文字符串 笔试题
- 字符串截取-笔试题
- 字符串笔试题集合
- 字符串笔试题一
- 字符串常见笔试题
- 字符串笔试题
- 笔试题--字符串处理
- 字符串笔试题
- 字符串笔试题
- 字符串笔试题
- 国内著名互联网企业PHP笔试题
- 拾光碎片-----保存失败!未将对象引用设置到对象的实例
- Session详解
- Matlab GUI设计
- spark 的RDD依赖系
- [noip2007tg] 统计数字
- 数组字符串,企业笔试题
- Canvas截图
- Android ViewPager+RadioGroup+Fragment超高仿微信主界面
- JS获取URL中参数值(QueryString)的4种方法
- jQuery中学习遇到的问题
- lightoj 1108 - Instant View of Big Bang(SPFA负环)
- 【常用JAVA代码片段】byte转成十六进制String
- NSObject的load和initialize方法
- 博弈论探讨及题目总结