목록Algorithm (127)
main
문제 : long 의 각 자리수를 뒤집어 배열로 만들기 1. 시간 초과 import java.util.*; class Solution { public ArrayList solution(long n) { ArrayList answer = new ArrayList(); int num = 0; while(n>0){ answer.add((int)n%10); n = n/10; } return answer; } } 2. 통과 class Solution { public int[] solution(long n) { // String.valueOf(long) StringBuilder sb = new StringBuilder(String.valueOf(n)); String str = sb.reverse().toString..
import java.util.*; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int num = scan.nextInt(); for (int i = 0; i < num; i++) { StringBuilder sb = new StringBuilder(scan.next()); System.out.println(sb.reverse().toString()); } scan.close(); } } * StringBuilder.reverse()
import java.util.Scanner; public class Main { public String solution(String str) { int count = 0; String answer = ""; String[] words = str.split(" "); for(String word : words) { if(word.length() > count) { count = word.length(); answer = word; } } return answer; } public static void main(String[] args) { Main m = new Main(); Scanner scan = new Scanner(System.in); String str = scan.nextLine(); Sy..
[방법1] import java.util.*; public class Main { public String solution(String str) { String answer = ""; for (char c : str.toCharArray()) { if (65
import java.util.*; public class Main { public int solution(String str, char t) { int answer = 0; str = str.toUpperCase(); t = Character.toUpperCase(t); // foreach 문 사용 for(char c : str.toCharArray()){ if(c == t){ answer++; } } // for문 사용 for(int i = 0; i < str.length(); i++){ if(str.charAt(i)==t){ answer++; } } return answer; } public static void main(String[] args) { Main M = new Main(); Scann..