已知线性表{a,a.....a.-1}元素按顺序存储,且每个元素都是不相等的整数。编写算法求表中奇数的个数。例如:L=
(1,2,3,4,5,6,7,8),奇数个数为:4
已知线性表{a,a.....a.-1}元素按顺序存储,且每个元素都是不相等的整数。编写算法求表中奇数的个数。例如:L=
(1,2,3,4,5,6,7,8),奇数个数为:4
#include <stdio.h>
typedef struct _seqlist
{
int data[1000];
int length;
}seqlist;
int main()
{
int L[8] ={1,2,3,4,5,6,7,8};
int count = 0,i;
seqlist s;
for(i=0;i<8;i++)
{
s.data[i] = L[i];
}
s.length = 8;
for(i=0;i<s.length;i++)
{
if(s.data[i] % 2 == 1)
count++;
}
printf("奇数个数为:%d",count);
return 0;
}