Problem:
Extraordinary Girl (II)

She loves e-mail so much! She sends e-mails by her cellular phone to
her friends when she has breakfast, she talks with other friends, and even
when she works in the library! Her cellular phone has somewhat simple
layout (Figure 1). Pushing button 1 once displays a character (’), pushing

it twice in series displays a character (,), and so on, and pushing it 6 times
displays (’) again. Button 2 corresponds to charaters (abcABC), and, for
example, pushing it four times displays (A). Button 3-9 have is similar to
button 1. Button 0 is a special button: pushing it once make her possible
to input characters in the same button in series. For example, she has to
push “20202” to display “aaa” and “660666” to display “no”. In addition,
pushing button 0 n times in series (n > 1) displays n − 1 spaces. She never
pushes button 0 at the very beginning of her input. Here are some examples
of her input and output:

666660666 --> No
44444416003334446633111 --> I’m fine.
20202202000333003330333 --> aaba f ff

One day, the chief librarian of the library got very angry with her and
hacked her cellular phone when she went to the second floor of the library
to return books in shelves. Now her cellular phone can only display button
numbers she pushes. Your task is to write a program to convert the sequence
of button numbers into correct characters and help her continue her e-mails!

Input

Input consists of several lines. Each line contains the sequence of button
numbers without any spaces. You may assume one line contains no more
than 10000 numbers. Input terminates with EOF.

Output

For each line of input, output the corresponding sequence of characters in
one line.

Sample Input

666660666
44444416003334446633111
20202202000333003330333

Output for the Sample Input

No
I'm fine.
aaba f ff

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;
public class Main {
		
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		char[][] inputs = {
				{' '},
				{'\'', ',', '.' , '!', '?'},
				{'a', 'b', 'c', 'A', 'B', 'C'},
				{'d', 'e', 'f', 'D', 'E', 'F'},
				{'g', 'h', 'i', 'G', 'H', 'I'},
				{'j', 'k', 'l', 'J', 'K', 'L'},
				{'m', 'n', 'o', 'M', 'N', 'O'},
				{'p', 'q', 'r' , 's', 'P', 'Q', 'R' , 'S'},
				{'t', 'u', 'v', 'T', 'U', 'V'},
				{'w', 'x', 'y', 'z', 'W', 'X', 'Y' , 'Z'},
		};
		
		while(sc.hasNext()){
			char[] in = sc.next().toCharArray();
			
			boolean find = false;
			int cur = -1;
			int count = 0;
			for(int i = 0; i < in.length; i++){
				if(!find){
					if(in[i] == '0'){
						System.out.print(inputs[cur][(count - 1) % inputs[cur].length]);
						cur = -1;
						count = 0;
						find = true;
					}else{
						if(cur != in[i] - '0' && count > 0){
							System.out.print(inputs[cur][(count - 1) % inputs[cur].length]);
							cur = in[i] - '0';
							count=1;
						}else{
							cur = in[i] - '0';
							count++;
						}
					}
				}else{
					if(in[i] == '0'){
						//System.out.println("he");
						System.out.print(inputs[0][0]);
					}else{
						find = false;
						cur = in[i] - '0';
						count++;
					}
				}
			}
			
			if(cur != -1 && count > 0){
				System.out.print(inputs[cur][(count - 1) % inputs[cur].length]);
			}
			
			System.out.println();
			
		}
	}
}