본문 바로가기
728x90

자바28

[IntelliJ] JAVA 버전 바꾸는 방법(JDK버전) 기존에 8버전을 쓰다가 11버전으로 변경해야 하는 프로젝트가 생겨서 기록해보는 "버전변경방법" 인텔리제이에서 6곳을 변경해주면 된다 (5곳 - 버전변경선택 / 1곳 - 원하는 JDK선택) Project Structure창 (단축키 : SHIFT+CTRL+ALT+S) * Project 1) SDK 변경 2) Language Level 변경 * Module 3) Language Level 변경 * SDKs 4) 원하는 JDK를 선택한다(JDK는 한 폴더에 모아두는것을 추천!) Project Setting (단축키 : CTRL+ALT+S) * Build,Execution,Deployment -> Build Tools -> Gradle 5) Gradle JVM 변경 * Build,Execution,Deploym.. 2022. 10. 5.
자바에서 HashMap을 위한 커스텀 키 생성 방법 Java에서 HashMap을 위한 Custom Key 정의하기 Java의 HashMap 자료구조는 고유한 값인 Key와 1:1로 연관되는 값(Value)을 하나의 쌍(Pair)로 하여 여러 개의 쌍을 저장하는 자료구조입니다. 흔히 Key 값으로 문자열이나 정수값을 사용하는 것으로도 충분합니다. 그러나 기능에 따라서 개발자가 특별한 Key에 대한 타입을 정의해야할 필요가 있습니다. 만약 개발자가 Key 타입으로 아래와 같은 클래스를 정의했다고 합시다. public class Identifier { private long A; private long B; private long C; public Identifier(long A, long B, long C) { this.A = A; this.B = B; th.. 2021. 10. 1.
SW Expert 보급로 (자바) import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; import java.util.PriorityQueue; import java.util.StringTokenizer; public class algo_1249_김어진 { public static int[] dx = { -1,0,1,0}; public static int[] dy = {0,1,0,-1}; public static void main(String[] args) throws Exception { System.setIn(new FileInputStream("input.txt")); BufferedReader br = new B.. 2021. 9. 30.
백준 1194 달이차오른다, 가자 (자바) import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; import java.util.Arrays; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class algo_1194_김어진 { static int N; static int M; static int[] dx = {-1,0,1,0}; static int[] dy = {0,1,0,-1}; public static void main(String[] args) throws Exception { System.setIn(n.. 2021. 9. 29.
백준 2458 키 순서 (자바) package ct02hw_대전_6반_김어진; import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class Main { static int N,K; public static void main(String[] args) throws Exception { System.setIn(new FileInputStream("sample_input.txt")); BufferedReader br = new BufferedReader(new InputStreamReader(System.. 2021. 9. 29.
프로그래머스 프린터(자바) import java.util.LinkedList; import java.util.PriorityQueue; import java.util.Queue; class Solution { public static int solution(int[] priorities, int location) { int answer = 1; Queue q = new LinkedList(); PriorityQueue pq = new PriorityQueue(); for (int i = 0; i < priorities.length; i++) { Printer pt = new Printer(i,priorities[i]); pq.add(pt); q.add(pt); } while(!q.isEmpty()){ Printer nowPt = .. 2021. 9. 29.
프로그래머스 전화번호 목록 (자바) import java.util.Arrays; class Solution { public static boolean solution(String[] phone_book) { boolean answer = true; Arrays.sort(phone_book); for (int i = 0; i phone_book[i+1].length()){ longStr = phone_book[i]; shortStr = phone_book[i+1]; } else{ shortStr = phone_book[i]; longStr = phone_book[i+1]; } if(s.. 2021. 9. 29.
프로그래머스 튜플 (자바) import java.util.Arrays; class Solution { public static boolean solution(String[] phone_book) { boolean answer = true; Arrays.sort(phone_book); for (int i = 0; i phone_book[i+1].length()){ longStr = phone_book[i]; shortStr = phone_book[i+1]; } else{ shortStr = phone_book[i]; longStr = phone_book[i+1]; } if(s.. 2021. 9. 29.
백준 7576 토마토 (자바) import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; import java.util.Arrays; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class algo_7576_김어진 { static int N; static int M; static int[][] board; static int[] dx = {-1,0,1,0}; static int[] dy = {0,1,0,-1}; public static void main(String[] args) throws Exce.. 2021. 9. 24.
행렬 테두리 회전 (자바) class Solution { public static int[] solution(int rows, int columns, int[][] queries) { int[] answer = new int[queries.length]; int[][] board = new int[rows][columns]; for (int i = 1; i =topLeft[1] ; i--) { int move = board[topRight[0]][i]; board[topRight[0]][i+1] = move; minValue = Math.min(minValue,move); } // 왼쪽 이동 for (int i = topLeft[0]+1; i 2021. 9. 23.
백준 14502 연구소 (자바) import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; import java.util.Arrays; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class algo_14502_김어진 { static int N; static int M; static int answer = 0; static int[] dx = {-1,0,1,0}; static int[] dy = {0,1,0,-1}; public static void main(String[] args) throws Ex.. 2021. 9. 17.
백준 9205 맥주 마시면서 걸어가기 (자바) import java.util.ArrayList; import java.util.Arrays; import java.util.Scanner; import java.io.FileInputStream; class Solution { public static void main(String args[]) throws Exception { System.setIn(new FileInputStream("sample_input.txt")); Scanner sc = new Scanner(System.in); int T; T=sc.nextInt(); for(int test_case = 1; test_case 2021. 9. 16.
SW expert 사람 네트워크2 (자바) import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; import java.util.StringTokenizer; public class algo_1263_김어진 { public static void main(String[] args) throws Exception { System.setIn(new FileInputStream("input.txt")); BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new StringTokenizer(br.readLine().. 2021. 9. 16.
최장 증가 부분수열 (이진탐색) import java.util.Arrays; import java.util.Scanner; public class DP2_LISTest2 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] arr = new int[N]; int[] LIS = new int[N]; for (int i = 0; i < N; i++) { arr[i]=sc.nextInt(); } int size=0; for (int i = 0; i < N; i++) { int temp = Math.abs(Arrays.binarySearch(LIS, 0,size,arr[i]))-1; LIS[temp] = .. 2021. 9. 16.
SW expert 3124 최소 스패닝 트리 (자바) import java.util.Arrays; import java.util.Scanner; import java.io.FileInputStream; class Solution { public static void main(String args[]) throws Exception { System.setIn(new FileInputStream("sample_input.txt")); Scanner sc = new Scanner(System.in); int T; T=sc.nextInt(); for(int test_case = 1; test_case 2021. 9. 16.
SW Expert 3307 최장 증가 부분수열 (자바) import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; import java.util.StringTokenizer; public class Solution { public static void main(String[] args) throws Exception { System.setIn(new FileInputStream("sample_input.txt")); BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; st = new StringTokenizer(br.readLine.. 2021. 9. 16.
백준 말이 되고픈 원숭이 (자바) import java.io.BufferedReader; import java.io.FileInputStream; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.LinkedList; import java.util.Queue; import java.util.StringTokenizer; public class algo_1600_김어진 { static int N; static int M; static int[] hx= new int[] {-1,-2,-2,-1,1,2,2,1}; static int[] hy= new int[] {-2,-1,1,2,2,1,-1,-2}; stat.. 2021. 9. 15.
백준 1149 RGB거리 (자바) import java.util.StringTokenizer; import java.io.BufferedReader; import java.io.FileInputStream; import java.io.InputStreamReader; class Main { static int[][] dp; public static void main(String args[]) throws Exception { System.setIn(new FileInputStream("input.txt")); BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st; int answer= Integer.MAX_VALUE; st =.. 2021. 9. 14.
백준 1463 1로 만들기 (자바) import java.util.Scanner; public class algo_1463_김어진 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] dp = new int[num+1]; if(num==1) { System.out.println(0); return; } else if(num==2) { System.out.println(1); return; } dp[1]=0; dp[2]=1; for (int i = 3; i 2021. 9. 14.
뉴스 클러스터링 (자바) package prog; import java.util.HashMap; public class 뉴스클러스터링 { public static void main(String[] args) { Solution_뉴스클러스터링 s = new Solution_뉴스클러스터링(); System.out.println(s.solution("FRANCE","french")); } } class Solution_뉴스클러스터링{ public int solution(String str1, String str2) { int answer = 0; HashMap map1 = new HashMap(); HashMap map2 = new HashMap(); makeMultiMap(map1,str1); makeMultiMap(map2,str.. 2021. 9. 12.
표편집 (자바) package prog; import java.util.Arrays; import java.util.LinkedList; import java.util.Stack; public class 표편집 { public static void main(String[] args) { Solution_표편집 s= new Solution_표편집(); System.out.println(s.solution(8,2,new String[] {"D 2","C","U 3","C","D 4","C","U 2","Z","Z"})); System.out.println(s.solution(8,2,new String[] {"D 2","C","U 3","C","D 4","C","U 2","Z","Z","U 1","C"})); } } clas.. 2021. 9. 12.
짝지어 제거하기 (자바) package prog; import java.util.Stack; public class 짝지어_제거하기 { public static void main(String[] args) { Solution_짝지어_제거하기 s = new Solution_짝지어_제거하기(); System.out.println(s.solution("baabaa")); System.out.println(s.solution("cdcd")); } } class Solution_짝지어_제거하기 { public int solution(String s) { int answer = -1; Stack stack = new Stack(); for (char c : s.toCharArray()) { if(stack.isEmpty()){ stack... 2021. 9. 9.
더 맵게 (자바) package prog; import java.util.PriorityQueue; import java.util.Queue; public class 더맵게 { public static void main(String[] args) { Solution_더맵게 s = new Solution_더맵게(); System.out.println(s.solution(new int[] {1, 2, 3, 9, 10, 12},7)); } } class Solution_더맵게 { public int solution(int[] scoville, int K) { int answer = 0; Queue pq = new PriorityQueue(); for (int i : scoville) { pq.add(i); } while(tru.. 2021. 9. 8.
타겟넘버 (자바) package prog; public class 타겟넘버 { public static void main(String[] args) { Solution_타겟넘버 s = new Solution_타겟넘버(); System.out.println(s.solution(new int[] {1, 1, 1, 1, 1},3)); } } class Solution_타겟넘버{ static int TG; static int answer; public int solution(int[] numbers, int target) { TG = target; dfs(numbers,0,0); return answer; } private void dfs(int[] numbers, int cnt, int now) { if(cnt == numbe.. 2021. 9. 8.
124 나라의 숫자 (자바) package prog; public class 일이사_나라의_숫자 { public static void main(String[] args) { 일이사_나라의_숫자_Solution s= new 일이사_나라의_숫자_Solution(); System.out.println(s.solution(1)); System.out.println(s.solution(2)); System.out.println(s.solution(3)); System.out.println(s.solution(4)); } } class 일이사_나라의_숫자_Solution{ public String solution(int n) { StringBuilder answer = new StringBuilder(); while(n!=0){ if(n%3!.. 2021. 9. 6.
멀쩡한 사각형 (자바) package prog; public class 멀쩡한_사각형 { public static void main(String[] args) { Solution_멀쩡한_사각형 s = new Solution_멀쩡한_사각형(); System.out.println(s.solution(8,12)); System.out.println(s.solution(2,3)); } } class Solution_멀쩡한_사각형{ public long solution(int w, int h) { long answer = 1; answer=(long)w*h - (w+h-gcd(w,h)); return answer; } public static int gcd(int a, int b) { while(b!=0){ int r = a%b; a=.. 2021. 9. 6.
프로그래머스 거리두기 확인하기 package prog; import java.util.Arrays; import java.util.LinkedList; import java.util.Queue; public class 거리두기_확인하기 { public static void main(String[] args) { Solution s = new Solution(); int[] answer =s.solution(new String[][] { {"POOOP", "OXXOX", "OPXPX", "OOXOX", "POXXP"}, {"POOPX", "OXPXP", "PXXXO", "OXXXO", "OOOPP"}, {"PXOPX", "OXOXP", "OXPOX", "OXXOP", "PXPOX"}, {"OOOXX", "XOOOX", "OOOXX", .. 2021. 8. 30.
java 순열, 중복 순열, 조합, 중복 조합 import java.util.Arrays; import java.util.Scanner; import com.sun.xml.internal.bind.v2.runtime.unmarshaller.XsiNilLoader.Array; public class DiceTest { static int N,numbers[],totalCnt; static boolean[] isSelected; public static void main(String[] args) { Scanner sc = new Scanner(System.in); N= sc.nextInt(); int M=sc.nextInt(); numbers = new int[N]; totalCnt = 0; switch(M) { case 1 : // 중복순열 dice.. 2021. 8. 3.
728x90

티스토리툴바