DataStructure&Algorithm (52) 썸네일형 리스트형 [DataStructure&Algorithm] 단어 뒤집기 section : String 1번 풀이 import java.util.ArrayList; import java.util.Scanner; public class Main { public ArrayList solution(String[] sa){ ArrayList answer = new ArrayList(); for(String str : sa){ char[] tmp = new char[str.length()]; int i = 1; for(char c : str.toCharArray()) { tmp[tmp.length-i] = c; i++; } answer.add(String.valueOf(tmp)); } return answer; } public static void main(String[] args){.. [DataStructure&Algorithm] 문장 속 단어 section : String import java.util.Scanner; public class Main { public String solution(String str){ int count = 0; String answer = " "; String[] sa = str.split(" "); for(int i = 0; i count){ count = sa[i].length(); answer = sa[i]; } } return answer; } public static void main(String[] args){ Main m = new Main(); Scanner scanner = new Scanner(System.in); String str = scanner.nextLine(); System.out... [DataStructure&Algorithm] 대소문자 변환 section : String 1번 풀이 import java.util.Scanner; public class Main { public String solution(String str){ char[] ca = str.toCharArray(); for(int i = 0; i=65 && x [DataStructure&Algorithm] 문자 찾기 section : String public class Main { public int solution(String str, char c){ int count = 0; str = str.toUpperCase(); c = Character.toUpperCase(c); for(char x : str.toCharArray()) { if(x==c) count++; } return count; } public static void main(String[] args){ Main m = new Main(); Scanner scanner = new Scanner(System.in); String str = scanner.next(); char c = scanner.next().charAt(0); System.out.pr.. 이전 1 ··· 4 5 6 7 다음