剑指Offer --> Questions 35

<span style="font-family:Courier New;font-size:12px;">#include <iostream>
#include <string>
#include <iterator>

using namespace std;

const int CHARNUM = 256;

unsigned char firstNotRepeatingChar(const string &s);

int main()
{
	string s;
	cin >> s;
	cout << firstNotRepeatingChar(s) << endl;
}

unsigned char firstNotRepeatingChar(const string &s)
{
	if (s.size() == 0)
	{
		cout << "invalid input.";
		return '\0';
	}

	unsigned charCountInString[CHARNUM];
	for (auto &count : charCountInString)
	{
		count = 0;
	}

	string temp = s;
	auto bIter = temp.begin();
	auto eIter = temp.end();
	while (bIter != eIter)
	{
		charCountInString[static_cast<unsigned>(*bIter)]++;
		bIter++;
	}

	bIter = temp.begin();
	while (bIter != eIter && charCountInString[*bIter] != 1)
	{
		bIter++;
	}

	if (bIter == eIter)
	{
		cout << "Don't have a character appear only one.";
		return '\0';
	}
	else
	{
		return *bIter;
	}
}</span>

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值