OJ Board

Code: Select all

import java.util.*;

public class Main {
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		boolean foundFlag = false;
		char c;
		int i, j, maxCount = 0;
		String input;
		
		Scanner sc = new Scanner(System.in);
		ArrayList<Character> charList = new ArrayList<Character>();
		ArrayList<Integer> counterList = new ArrayList<Integer>();
		ArrayList<Boolean> caseList = new ArrayList<Boolean>();
		
		while(sc.hasNextLine()) {
			maxCount = 0;
			foundFlag = false;
			charList.clear();
			counterList.clear();
			caseList.clear();
			
			input = sc.nextLine();
			for(i=0; i<input.length(); i++) {
				c = input.charAt(i);
				if(Character.isLetter(c)) {
					for(j=0; j<charList.size(); j++) {
						if(charList.get(j) == c) {
							counterList.set(j, counterList.get(j)+1);
							if(counterList.get(j) > maxCount) maxCount = counterList.get(j);
							foundFlag = true;
							break;
						}
						else
							foundFlag = false;
					}
					if(!foundFlag) {
						charList.add(c);
						counterList.add(1);
						caseList.add(Character.isUpperCase(c));
						if(maxCount == 0) maxCount = 1;
					}
				}
			}
			for(i=0; i<charList.size(); i++) {
				if((counterList.get(i) == maxCount) && (caseList.get(i) == true))
					System.out.print(charList.get(i).toString());					
			}
			for(i=0; i<charList.size(); i++) {
				if((counterList.get(i) == maxCount) && (caseList.get(i) == false))
					System.out.print(charList.get(i).toString());					
			}
			
			System.out.print(" " + maxCount + "\n");
		}
		sc.close();
		return;
	}
}

Code: Select all

#include <stdio.h>
#include <algorithm>

using namespace std;

char s[100000];
int map[256];

int main() {
	int i, max;
	
	while (gets(s)) {
		i = 0;
		fill(map, map + 256 * 2, 0);
		while (s[i] != '\0') {
			map[s[i]] += 1;
			i++;
		}
		max = 0;
		for (i = 'A'; i <= 'Z'; i++) {
			if (map[i] > max) max = map[i];
		}
		for (i = 'a'; i <= 'z'; i++) {
			if (map[i] > max) max = map[i];
		}
		if (max == 0) {
			printf(" 0\n");
			continue;
		}
		for (i = 'A'; i <= 'Z'; i++) {
			if (map[i] == max) printf("%c", i);
		}
		for (i = 'a'; i <= 'z'; i++) {
			if (map[i] == max) printf("%c", i);
		}
		printf(" %d\n", max);
	}
	return(0);
}