![[인프런 알고리즘] Chapter 1, 9번 문제(숫자만 추출)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fm7t3k%2FbtsIrPnTRZo%2FAAAAAAAAAAAAAAAAAAAAALPL_fZ7GNTe3SD3EfteY8UhP6rgd6lcGPRdXNho1dJn%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DovIiXlMj%252B1aUD%252B9yTijHGuMpoCI%253D)
이 알고리즘 문제는 인프런의 자바(Java) 알고리즘 문제풀이 입문: 코딩테스트 대비 (김태원)의 문제입니다.문제 설명 코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class Main { public static String solution(String str) { String result = ""; for (char c : str.toCharArray()) { if(Character.isDigit(c)) { if(!(c == '0') || !(result.lengt..
![[인프런 알고리즘] Chapter 1, 8번 문제(유효한 팰린드롬)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FQvRVm%2FbtsIpMZNa9a%2FAAAAAAAAAAAAAAAAAAAAAAln1o065nI8c0DQ7FFQDRVotvzRz0vmw_roqga9fvPj%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DEX5wlq5CljMfvxlLgQuBBe141o4%253D)
이 알고리즘 문제는 인프런의 자바(Java) 알고리즘 문제풀이 입문: 코딩테스트 대비 (김태원)의 문제입니다.문제 설명 코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class sec01_08 { public static String solution(String str) { int lp = 0; int rp = str.length() - 1; String lower = str.toLowerCase(); while (lp 설명코드 주석 참고
![[인프런 알고리즘] Chapter 1, 7번 문제(회문 문자열)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FOWUgx%2FbtsIqRsd9wl%2FAAAAAAAAAAAAAAAAAAAAAOqAEwRiAzq_qXg5A_qHL1HVqhx1xXP1kWzSgvy7ZNhn%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3D9O%252Bh0K1aOkuOAJevHNVrN%252B6TMIA%253D)
이 알고리즘 문제는 인프런의 자바(Java) 알고리즘 문제풀이 입문: 코딩테스트 대비 (김태원)의 문제입니다.문제 설명 코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class sec01_07 { public static String solution(String str) { int lp = 0; int rp = str.length() -1; String lower = str.toLowerCase(); char[] temp = lower.toCharArray(); while (lp 설명solution 메서드는 문자열 st..
![[인프런 알고리즘] Chapter 1, 6번 문제(중복 문자 제거)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FwVUDr%2FbtsIpUXyVjO%2FAAAAAAAAAAAAAAAAAAAAAIWH-2eHQmBrUhOCynX6CZDdNYF3J-bSny9FY4eqZ1bF%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3D9wvEqWwvX61BuKgGBj8s6tPbgSY%253D)
이 알고리즘 문제는 인프런의 자바(Java) 알고리즘 문제풀이 입문: 코딩테스트 대비 (김태원)의 문제입니다.문제 설명 코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class sec01_06 { public static String solution(String str){ String result = ""; for (int i = 0; i 또는import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.HashMap;..
![[Java] 백준 10986번 문제(나머지 합)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FcC2Sh0%2FbtsIpyHhvFF%2FAAAAAAAAAAAAAAAAAAAAAOx9-PPFvMxCatg6YaW_Jhw7fRbln_ujnm77HvSIb1Mp%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DAEaeSKYpn4DH8mJUZEtT3p9hIEA%253D)
원본 출처 : https://www.acmicpc.net/problem/10986 문제설명 소스코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class Boj_10986{ public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(..
![[인프런 알고리즘] Chpater 1, 5번 문제(특정 문자 뒤집기)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FccbpKy%2FbtsIo8Wl6o3%2FAAAAAAAAAAAAAAAAAAAAAJ_NWXz1gctUa5P3CJ77YqcL57_GaE81X-BNBvKYps-R%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DR5SKe8LmefrMkULsAQrTjuqvyPo%253D)
이 알고리즘 문제는 인프런의 자바(Java) 알고리즘 문제풀이 입문: 코딩테스트 대비(https://cote.inflearn.com/contest/10/problems) (김태원)의 문제입니다.문제 설명 코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class sec01_05 { public static String solution(String str) { char[] temp = str.toCharArray(); int lp = 0; int rp = str.length() - 1; while (lp 설명초기 설정char[] tem..
![[인프런 알고리즘] Chapter 1, 4번 문제(단어 뒤집기)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FLqw4C%2FbtsIp9mgyUG%2FAAAAAAAAAAAAAAAAAAAAAPMarPjDHFo3AddP3Rk9UUeGqPaIYyL9tkvUPqFzX4Kl%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DC4AK3im%252B1VNrtVdHlc9%252Fl0rY4LE%253D)
이 알고리즘 문제는 인프런의 자바(Java) 알고리즘 문제풀이 입문: 코딩테스트 대비(https://cote.inflearn.com/contest/10/problems) (김태원)의 문제입니다.문제 설명 코드import java.io.IOException;import java.util.Scanner;public class sec01_04 { public static void solution(String[] str) { StringBuilder sb = new StringBuilder(new String("")); for (String s : str) { sb.append(new StringBuilder(s).reverse()).append("\n"); ..
![[Java] 백준 11660번 문제(구간 합 구하기 5)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FLyDd5%2FbtsIojPLq19%2FAAAAAAAAAAAAAAAAAAAAALj6mbsPWGx85Dwduy42x6HW_qNsEojIgxVYanZEWfYa%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1756652399%26allow_ip%3D%26allow_referer%3D%26signature%3DWGJCGmDME8Bi4iGjUiS0SRRZtCg%253D)
원본 링크 : https://www.acmicpc.net/problem/11660 문제설명 소스코드import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.StringTokenizer;public class Boj_11660{ public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(..