Language/Algorithm28 Remove duplicate characters Example Input : ksekkset Output : kset My answer: import java.util.Scanner; class CharacterUniqueFinder { public static void main(String[] args) { CharacterUniqueFinder t = new CharacterUniqueFinder(); Scanner kb = new Scanner(System.in); String s = kb.nextLine(); System.out.println(t.solution(s)); } String solution(String s) { String answer = ""; char[] ca = s.toCharArray(); for(char x : ca) { .. 2023. 8. 26. Reverse Alphabetic Characters Example Input : a#b!GE*T@S Output : S#T!EG*b@a My answer: import java.util.Scanner; class StringReverser { public static void main(String[] args) { StringReverser t = new StringReverser(); Scanner kb = new Scanner(System.in); String s = kb.nextLine(); System.out.println(t.solution(s)); } String solution(String s) { String answer = ""; char[] ca = s.toCharArray(); int rt = s.length() - 1; for(int.. 2023. 8. 25. Reverse String Example Input : 3 , [Good, Time, Study] Output : [dooG, emiT, ydutS] My answer: import java.util.Scanner; import java.util.List; import java.util.ArrayList; import java.lang.StringBuilder; class StringReversalProcessor { public static void main(String[] args) { StringReversalProcessor t = new StringReversalProcessor(); Scanner kb = new Scanner(System.in); int cnt = kb.nextInt(); String[] s = new.. 2023. 8. 24. Find the longest word Example Input : It is time to study Output : study My answer: import java.util.Scanner; class LongestWordFinder { public static void main(String[] args) { LongestWordFinder T = new LongestWordFinder(); Scanner kb = new Scanner(System.in); String s = kb.nextLine(); System.out.println(T.solution(s)); } String solution(String s) { String answer = ""; while (s.indexOf(" ") != -1) { String tmp = s.su.. 2023. 8. 23. 이전 1 ··· 4 5 6 7 다음
