华为oj 字符串个数统计&&数字颠倒&&字符串翻转&&字符逆序&&求int型数据在内存中存储时1的个数

同样只上程序，都是简单题

#include<iostream>
using namespace std;
int main()
{
	int in[128], count = 0;
	char n,temp[100];
	memset(in, 0, sizeof(int)* 128);
	gets(temp);
	int len = strlen(temp);
	if (len <= 0)
	{
		return 0;
	}
	for (int i = 0; i < len; i++)
	{
		in[temp[i]]++;
	}
	
	for (int i = 0; i<128; i++)
	{
		if (in[i] != 0)
		{
			count++;
		}
	}
	cout << count << endl;
	return 0;
}

#include<iostream>
using namespace std;
int main()
{
char in[100];
gets(in);
int len =strlen(in);
for(int i=len-1;i>=0;i--)
{
cout<<in[i];
}
cout<<endl;
}

#include<iostream>
using namespace std;
int main()
{
	char in[100], temp;
	gets_s(in);
	int len = strlen(in);
	for (int i = 0; i<len / 2; i++)
	{
		temp = in[i];
		in[i] = in[len - i - 1];
		in[len - i - 1] = temp;
	}
	cout << in << endl;
	return 0;
}

#includeiostream
#includevector
#includestring
using namespace std;
int main()
{
	vectorstring ss;
	string s;
	while (cin  s)
	{
		ss.push_back(s);
	}
	for (int k = ss.size()-1; k =0 ; k--)
	{
		cout  ss[k];
		if (k != 0)
		{
			cout  ' ';
		}
	}
	return 0;
}

对于最后一题是重复的前面已经写过在此给出链接

点击打开链接