개발생각

import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class BaekjoonAlgo_2941 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		
		String str = sc.next();
		int count = 0;
		
		String[] croAlpha = {"c=", "c-", "dz=", "d-", "lj", "nj", "s=", "z="};
		
		for(int i=0;i<croAlpha.length;i++) {	
			
			Pattern p = Pattern.compile(croAlpha[i]);
			Matcher m = p.matcher(str);
			
			for (int j = 0; m.find(j); j = m.end()) {
			    count++;
			    str = str.replaceAll(croAlpha[i], " ");
			}
		}
		
		str = str.replaceAll(" ", "");
		char[] arr = str.toCharArray();
		
		for(int i=0;i<arr.length;i++) {
			count++;
		}
		
		System.out.println(count);
	}
}

import java.util.Scanner;

public class BaekjoonAlgo_1316 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		
		int testCase = sc.nextInt();
		int groupWord = 0;
		
		for(int i=0;i<testCase;i++) {
			String str= sc.next();
			
			boolean[] alpha = new boolean[26];
			char[] arr= str.toCharArray();
			char prev= ' ';
			char now = ' ';
			
			for(int j=0;j<arr.length;j++) {
				now = arr[j];
				
				// 이미 나온 문자 체크
				if(alpha[now -'a']) {
					// 앞글자와 다른 글자면 해당 문자 false 처리
					if(prev != now) {
						alpha[now-'a'] = false;
					}  
				} else {
					alpha[now-'a'] = true;
				}
				
				prev= arr[j];
				
				if(!alpha[now-'a']) break;
				else if(j==arr.length-1) groupWord++;
			}
		}
		
		System.out.println(groupWord);
	}

}

import java.util.Scanner;

public class BaekjoonAlgo_5622 {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		String str = sc.next();
		char[] arr = str.toCharArray();
		
		int result = 0;
		
		for(int i=0;i<arr.length;i++) {
			if((int)arr[i] <68) result +=3;
			else if((int)arr[i] < 71) result +=4;
			else if((int)arr[i] < 74) result +=5;
			else if((int)arr[i] < 77) result +=6;
			else if((int)arr[i] < 80) result +=7;
			else if((int)arr[i] < 84) result +=8;
			else if((int)arr[i] < 87) result +=9;
			else if((int)arr[i] < 91) result +=10;
		}
		
		System.out.println(result);
	}
}

import java.util.Scanner;

public class BaekjoonAlgo_1152 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		
		String str= sc.nextLine();
		String[] arr =str.split(" ");
		
		int result = arr.length;
		
		for(int i=0;i<arr.length;i++) {
			if(arr[i].equals("")) {
				result-=1;
			}
		}
		
		System.out.println(result);
	}

}

import java.util.Scanner;

public class BaekjoonAlgo_1157 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		
		String str = sc.next();
		char[] arr = new char[26];
		
		for(int i=0;i<str.length();i++) {
			if('A' <= str.charAt(i) && str.charAt(i) <= 'Z') {
				arr[str.charAt(i) - 'A']++;
			} else {
				arr[str.charAt(i) - 'a']++;
			}
		}
		
		int max = -1;
		char finalChar = '?';
		
		for(int i=0;i<arr.length;i++) {
			if(arr[i] > max) {
				max = arr[i];
				finalChar = (char)(i+65);
			}
			else if(arr[i] == max) {
				finalChar = '?';
			}
		}
		
		System.out.println(finalChar);
	}

}