[TopCoder] HappyLetterDiv2

http://community.topcoder.com/stat?c=problem_statement&pm=13245

is a string, the character inside can be arbitrarily 22 elimination, if not, then finally if a character, the character is winning letter. If any method is eliminated is this winning letter, called Happy Letter. asks if happy letter exists. The problem is actually to find the majority. Note that it is more than LENGTH/2 to sweep over.

#include <string>using namespace Std;class HappyLetterDiv2 {Public:char gethappyletter (string letters) {Char ch = Letters[0];int count = 1;int n = letters.size (); for (int i = 1; i < n; i++) {if (Count > 0 && letters[i]! = C h) {count--;} else//Count = = 0 | | Letters[i] = = Ch{count++;ch = Letters[i];}} Count = 0;for (int i = 0; i < n; i++) {if (letters[i] = = ch) count++;} if (Count > N/2) return Ch;elsereturn '. ';};