■ 알고리즘 문제 풀이/SWEA (15) 썸네일형 리스트형 [SWEA-D3] 1213. String ▶문제설명[SWEA] 1213. Stringhttps://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14P0c6AAUCFAYi&categoryId=AV14P0c6AAUCFAYi&categoryType=CODE ▶Hint패턴 매칭 알고리즘을 활용한다. ▶Solution123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172#include#includeusing namespace std; string str, pattern;int pa.. [SWEA-D4] 1211. Ladder2 ▶문제설명[SWEA] 1211. Ladder2https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14BgD6AEECFAYh&categoryId=AV14BgD6AEECFAYh&categoryType=CODE ▶Solution12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364import java.util.*; class Solution{ public static int map[][] = new int[100][100]; public static void.. [SWEA-D4] 1210. Ladder1 ▶문제설명[SWEA] 1210. Ladder1https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14ABYKADACFAYh&categoryId=AV14ABYKADACFAYh&categoryType=CODE ▶Solution123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657import java.util.*; class Solution{ public static int map[][] = new int[100][100]; public static boolean[][] visite.. [SWEA-D3] 1209. Sum ▶문제설명[SWEA] 1209. Sumhttps://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13_BWKACUCFAYh&categoryId=AV13_BWKACUCFAYh&categoryType=CODE ▶Solution12345678910111213141516171819202122232425262728293031323334353637383940414243444546import java.util.*; class Solution{ public static int[][] arr = new int[100][100]; public static void main(String[] args){ Scanner sc = new S.. [SWEA-D3] 1206. View ▶문제설명[SWEA] 1206. Viewhttps://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV134DPqAA8CFAYh&categoryId=AV134DPqAA8CFAYh&categoryType=CODE ▶Solution1234567891011121314151617181920212223242526272829303132333435363738394041424344import java.util.*; class Solution{ public static void main(String args[]) throws Exception{ int T = 1; int W = 0; int H = 0; int[] HArr = new i.. [SWEA-D3] 1208. Flatten ▶문제설명[SWEA] 1208. Flattenhttps://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV139KOaABgCFAYh&categoryId=AV139KOaABgCFAYh&categoryType=CODE ▶Solution1234567891011121314151617181920212223242526272829303132import java.util.*; class Solution{ public static int[] BoxArr = new int[100]; public static int DumpNum = 0; public static int val = -1; public static void main(Str.. [SWEA-D2] 1204. 최빈수 구하기 ▶문제설명[SWEA] 1204. 최빈수 구하기https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE ▶Solution1234567891011121314151617181920212223242526272829303132import java.util.Scanner;import java.io.FileInputStream;import java.util.*; class Solution{ public static void main(String args[]) throws Exception { Scanner sc = ne.. 이전 1 2 다음