목록til/Algorithm (30)
min's devlog
import java.util.*; class Main { public String solution(String str){ String answer=""; for(int i=0; i
import java.util.*; class Main { public String solution(String str){ String answer; char[] s=str.toCharArray(); int lt=0, rt=str.length()-1; while(lt

import java.util.*; class Main { public ArrayList solution(int n, String[] str){ ArrayList answer=new ArrayList(); for(String x : str){ String tmp=new StringBuilder(x).reverse().toString(); answer.add(tmp); } return answer; } public static void main(String[] args){ Main T = new Main(); Scanner kb = new Scanner(System.in); int n=kb.nextInt(); String[] str=new String[n]; for(int i=0; i

import java.util.*; class Main { public String solution(String str){ String answer=""; int m=Integer.MIN_VALUE; String[] s = str.split(" "); for(String x : s){ int len=x.length(); if(len>m){ m=len; answer=x; } } return answer; } public static void main(String[] args){ Main T = new Main(); Scanner kb = new Scanner(System.in); String str=kb.nextLine(); System.out.print(T.solution(str)); } } import..

import java.util.*; class Main { public String solution(String str){ String answer=""; for(char x : str.toCharArray()){ if(Character.isLowerCase(x)) answer+=Character.toUpperCase(x); else answer+=Character.toLowerCase(x); } return answer; } public static void main(String[] args){ Main T = new Main(); Scanner kb = new Scanner(System.in); String str=kb.next(); System.out.print(T.solution(str)); } ..