├── .github ├── CODEOWNERS └── PULL_REQUEST_TEMPLATE.md ├── For-Beginner.md ├── README.md ├── baekjoon ├── 1000.A+B │ └── pppeum62.java ├── 10171.고양이 │ └── Moon-HyeKyung.c ├── 10718.We_love_kriii │ └── Moon-HyeKyung.c ├── 10757.큰_수_A+B │ └── pppeum62.java ├── 10809.알파벳_찾기 │ └── pppeum62.java ├── 10818.최소,_최대 │ └── pppeum62.java ├── 1085.직사각형에서_탈출 │ └── pppeum62.java ├── 1110.더하기_사이클 │ └── pppeum62.java ├── 1152.단어의_개수 │ ├── dayomi02.c │ └── pppeum62.java ├── 11654.아스키_코드 │ └── pppeum62.java ├── 14681.사분면_고르기 │ └── pppeum62.java ├── 1546.평균 │ └── pppeum62.java ├── 15596.정수_N개의_합 │ └── pppeum62.java ├── 18108.1998년생인_내가_태국에서는_2541년생 │ └── pppeum62.java ├── 25205.경로당펑크_2077 │ └── pppeum62.java ├── 2557.Hello_World │ └── Moon-HyeKyung.c ├── 2562.최댓값 │ └── pppeum62.java ├── 2750.수_정렬하기 │ └── pppeum62.java ├── 2753.윤년 │ └── pppeum62.java ├── 2869.달팽이는_올라가고_싶다 │ └── pppeum62.java ├── 2884.알람_시계 │ └── pppeum62.java ├── 2908.상수 │ ├── dayomi02.c │ └── pppeum62.java ├── 3460.이진수 │ └── pppeum62.java ├── 4344.평균은_넘겠지 │ └── pppeum62.java └── README.md ├── goormedu └── 알고리즘{먼데이} │ ├── [1주차]-1.경로의_개수 │ └── areumsheep.js │ ├── [1주차]-2.동명이인 │ └── areumsheep.js │ ├── [1주차]-3.최장_맨해튼_거리 │ └── areumsheep.js │ ├── [1주차]-4.소수_찾기 │ └── areumsheep.js │ ├── [2주차]-1.합격자_찾기 │ └── areumsheep.js │ ├── [2주차]-2.철자_분리_집합 │ └── areumsheep.js │ ├── [2주차]-3.출석부 │ └── areumsheep.js │ ├── [2주차]-4.폭탄_구현하기 │ └── areumsheep.js │ └── [3주차]-1.0커플 │ └── areumsheep.js ├── leetcode ├── Array │ ├── 1.Two_Sum │ │ └── areumsheep.js │ ├── 121.Best_Time_to_Buy_and_Sell_Stock │ │ └── areumsheep.js │ ├── 217.Contains_Duplicate │ │ └── areumsheep.js │ ├── 238.Product_of_Array_Except_Self │ │ └── areumsheep.js │ └── 53.Maximum_Subarray │ │ └── areumsheep.js ├── Binary_Search │ └── 704.Binary_Search │ │ └── areumsheep.js ├── Linked_List │ └── 234.Palindrome_Linked_List │ │ └── areumsheep.js ├── Matrix │ └── 73.Set_Matrix_Zeroes.js ├── Stack │ └── 20.Valid_Parentheses │ │ └── areumsheep.js └── String │ └── 125.Valid_Palindrome │ └── Leemainsw.js └── programmers ├── README.md └── 난이도별 ├── level01.2016년 ├── JiaLee0707.c ├── Moon-HyeKyung.c++ ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areum.js ├── heena.java └── yoojinhee03.java ├── level01.3진법_뒤집기 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js └── pppeum62.js ├── level01.K번째수 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js ├── pppeum62.js └── yoojinhee03.java ├── level01.[1차]_다트_게임 └── SSSOy.java ├── level01.[1차]_비밀지도 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js ├── pppeum62.js └── yoojinhee03.java ├── level01.x만큼_간격이_있는_n개의_숫자 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.java ├── pppeum62.js └── yoojinhee03.java ├── level01.가운데_글자_가져오기 ├── JiaLee0707.c ├── JiaLee0707.java ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.java ├── pppeum62.js ├── suhyeon.java ├── yeeun.js └── yoojinhee03.java ├── level01.같은_숫자는_싫어 ├── JiaLee0707.js ├── Moon-HyeKyung.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.java ├── pppeum62.js └── yoojinhee03.java ├── level01.공원_산책 └── JiaLee0707.js ├── level01.나누어_떨어지는_숫자배열 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.js └── yoojinhee03.java ├── level01.나머지가_1이_되는_수_찾기 ├── JiaLee0707.js ├── SSSOy.java └── pppeum62.java ├── level01.내적 ├── JiaLee0707.c ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js ├── pppeum62.js └── y2ny.js ├── level01.동물의_아이디와_이름 ├── Moon-Hyekyung.sql ├── Suhyeon.sql ├── areumsheep.sql ├── heena.sql └── yoojinhee03.sql ├── level01.두_개_뽑아서_더하기 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js ├── devSOWON0628.js ├── pppeum62.js └── yoojinhee03.java ├── level01.두_정수_사이의_합 ├── JiaLee0707.c ├── JiaLee0707.java ├── SSSOy.java ├── SSSOy.py ├── areumsheep.java ├── pppeum62.js ├── suhyeon.java ├── yeeun.c └── yoojinhee03.java ├── level01.로또의_최고_순위와_최저_순위 ├── SSSOy.java ├── areumsheep.js ├── pppeum62.js └── pppeum62.kt ├── level01.모의고사 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js ├── pppeum62.java └── yoojinhee03.java ├── level01.문자열_내_p와_y의_개수 ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.js ├── suhyeon.js ├── yeeun.js └── yoojinhee03.java ├── level01.문자열_내_마음대로_정렬하기 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areum.js └── pppeum62.java ├── level01.문자열_내림차순으로_배치하기 ├── JiaLee0707.c ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areum.js ├── pppeum62.js └── y2ny.js ├── level01.문자열_다루기_기본 ├── Moon-Hyekyung.js ├── SSSOy.py ├── pppeum62.js └── yeeun.js ├── level01.문자열을_정수로_바꾸기 ├── JiaLee0707.c ├── Moon-Hyekyung.js └── yoojinhee03.java ├── level01.복서_정렬하기 └── SSSOy.java ├── level01.부족한_금액_계산하기 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── pppeum62.java ├── pppeum62.js └── y2ny.js ├── level01.삼총사 └── JiaLee0707.js ├── level01.상위_n개_레코드 └── Suhyeon.sql ├── level01.상호_평가 └── SSSOy.java ├── level01.상호평가 └── pppeum62.js ├── level01.서울에서_김서방_찾기 ├── JiaLee0707.js ├── Moon-HyeKyung.js ├── SSSOy.java ├── SSSOy.py ├── Suhyeon.js ├── pppeum62.js └── yeeun.js ├── level01.성격_유형_검사하기 ├── JiaLee0707.js └── areumsheep.js ├── level01.소수_만들기 ├── SSSOy.java └── pppeum62.js ├── level01.소수_찾기 ├── JiaLee0707.js ├── Leemainsw.js ├── Leemainsw.ts ├── SSSOy.java ├── SSSOy.py ├── areum.java └── pppeum62.java ├── level01.수박수박수박수박수박수 ├── JiaLee0707.c ├── JiaLee0707.java ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.js ├── sokkanji.js ├── suhyeon.java └── yoojinhee03.java ├── level01.숫자_문자열과_영단어 ├── SSSOy.java ├── areumsheep.js ├── pppeum62.java └── pppeum62.js ├── level01.시저_암호 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js └── pppeum62.js ├── level01.신고_결과_받기 ├── SSSOy.java └── areumsheep.js ├── level01.신규_아이디_추천 ├── SSSOy.py ├── areumsheep.js └── pppeum62.js ├── level01.실패율 ├── SSSOy.java └── SSSOy.py ├── level01.아픈_동물_찾기 ├── pppeum62.sql ├── suhyeon.sql └── yoojinhee03.sql ├── level01.약수의_개수와_덧셈 ├── JiaLee0707.js ├── SSSOy.java └── pppeum62.js ├── level01.약수의_합 ├── JiaLee0707.c ├── JiaLee0707.java ├── SSSOy.java ├── SSSOy.py ├── areum.js ├── heena01.py ├── pppeum62.java ├── wander0220.js └── yoojinhee03.java ├── level01.어린_동물_찾기 └── SSSOy.sql ├── level01.없는_숫자_더하기 ├── JiaLee0707.js ├── SSSOy.java ├── areumsheep.js ├── jeyin720.js ├── pppeum62.java ├── pppeum62.js └── y2ny.js ├── level01.여러_기준으로_정렬하기 ├── Moon-Hyekyung.sql └── Suhyeon.sql ├── level01.역순_정렬하기 └── yoojinhee03.sql ├── level01.예산 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.js ├── pppeum62.js └── yoojinhee03.java ├── level01.완주하지_못한_선수 ├── JiaLee0707.java ├── SSSOy.java ├── SSSOy.py ├── devSOWON0628.java ├── pppeum62.js ├── sokkanji.js └── yoojinhee03.java ├── level01.음양_더하기 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── areumsheep.js ├── devSOWON0628.java ├── pppeum62.js └── y2ny.js ├── level01.이름이_없는_동물의_아이디 └── pppeum62.sql ├── level01.이름이_있는_동물의_아이디 ├── Moon-HyeKyung.sql └── pppeum62.sql ├── level01.이상한_문자_만들기 ├── JiaLee0707.c ├── Leemainsw.js ├── Leemainsw.ts ├── SSSOy.java ├── SSSOy.py ├── areum.js ├── pppeum62.js └── yoojinhee03.java ├── level01.자릿수_더하기 ├── JiaLee0707.c ├── Moon-Hyekyung.js ├── SSSOy.c ├── areum.js ├── pppeum62.js └── yoojinhee03.java ├── level01.자연수_뒤집어_배열로_만들기 ├── JiaLee0707.c ├── Leemainsw.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areum.js └── pppeum62.js ├── level01.정수_내림차순으로_배치하기 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areum.js ├── pppeum62.js └── y2ny.js ├── level01.정수_제곱근_판별 ├── JiaLee0707.c ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areum.js ├── pppeum62.js └── yoojinhee03.java ├── level01.제일_작은_수_제거하기 ├── JiaLee0707.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.js └── yoojinhee03.java ├── level01.직사각형_별찍기 ├── JiaLee0707.c ├── JiaLee0707.java ├── SSSOy.py ├── areum.js ├── pppeum62.go └── pppeum62.js ├── level01.직업군_추천하기 └── SSSOy.java ├── level01.짝수와_홀수 ├── JiaLee0707.c ├── JiaLee0707.java ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areumsheep.java └── y2ny.js ├── level01.체육복 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py ├── areum.js └── devSOWON0628.java ├── level01.최대공약수와_최소공배수 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py └── areum.js ├── level01.최소직사각형 ├── JiaLee0707.js └── SSSOy.java ├── level01.최솟값_구하기 └── yoojinhee03.sql ├── level01.콜라츠_추측 ├── JiaLee0707.c ├── JiaLee0707.java ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── Suhyeon.js ├── areumsheep.js ├── pppeum62.js ├── yeeun.js └── yoojinhee03.java ├── level01.크레인_인형뽑기_게임 ├── SSSOy.java ├── SSSOy.py ├── pppeum62.java └── yoojinhee03.java ├── level01.키패드_누르기 ├── SSSOy.java └── sokkanji.js ├── level01.평균_구하기 ├── JiaLee0707.c ├── JiaLee0707.java ├── Leemainsw.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── Suhyeon.java ├── y2ny.js └── yoojinhee03.java ├── level01.폰켓몬 ├── JiaLee0707.js ├── SSSOy.java ├── areumsheep.js └── pppeum62.js ├── level01.하샤드_수 ├── JiaLee0707.c ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py ├── areum.js ├── pppeum62.js └── yoojinhee03.java ├── level01.핸드폰_번호_가리기 ├── JiaLee0707.c ├── Leemainsw.js ├── Moon-Hyekyung.js ├── SSSOy.java ├── SSSOy.py └── pppeum62.js ├── level01.행렬의_덧셈 ├── JiaLee0707.js ├── SSSOy.java ├── SSSOy.py ├── pppeum62.js ├── y2ny.js └── yoojinhee03.java ├── level02.124_나라의_숫자 └── SSSOy.java ├── level02.DATETIME에서_DATE로_형_변환 ├── SSSOy.sql ├── areumsheep.sql └── pppeum62.sql ├── level02.H-Index ├── JiaLee0707.js ├── Leemainsw.js └── SSSOy.java ├── level02.JadenCase_문자열 만들기 ├── SSSOy.java └── areumsheep.js ├── level02.NULL_처리하기 ├── SSSOy.sql ├── Suhyeon.sql ├── pppeum62.sql ├── sokkanji.sql └── yoojinhee03.sql ├── level02.[1차]_뉴스_클러스터링 └── SSSOy.java ├── level02.[1차]_캐시 └── SSSOy.java ├── level02.가장_큰_수 ├── SSSOy.java └── pppeum62.js ├── level02.게임_맵_최단거리 └── areumsheep.js ├── level02.고양이와_개는_몇_마리_있을까 ├── SSSOy.sql ├── pppeum62.sql └── yeeun.sql ├── level02.괄호_회전하기 └── SSSOy.java ├── level02.기능개발 ├── SSSOy.java └── yoojinhee03.java ├── level02.다리를_지나는_트럭 └── SSSOy.java ├── level02.다음_큰_숫자 ├── SSSOy.py └── pppeum62.js ├── level02.더_맵게 ├── SSSOy.java ├── pppeum62.java └── yoojinhee03.java ├── level02.동명_동물_수_찾기 ├── SSSOy.sql └── pppeum62.sql ├── level02.동물_수_구하기 └── SSSOy.sql ├── level02.땅따먹기 └── areumsheep.js ├── level02.루시와_엘라_찾기 ├── SSSOy.sql ├── Suhyeon.sql ├── areumsheep.sql ├── pppeum62.sql └── sokkanji.sql ├── level02.스킬트리 └── SSSOy.java ├── level02.영어_끝말잇기 └── SSSOy.java ├── level02.예상_대진표 └── SSSOy.java ├── level02.오픈채팅방 ├── Leemainsw.js └── pppeum62.js ├── level02.올바른_괄호 ├── SSSOy.java ├── areumsheep.js ├── pppeum62.js └── yoojinhee03.java ├── level02.이름에_el이_들어가는_동물_찾기 ├── Suhyeon.sql └── areumsheep.sql ├── level02.이진_변환_반복하기 ├── SSSOy.py └── areumsheep.js ├── level02.입양_시각_구하기(1) ├── SSSOy.sql ├── Suhyeon.sql └── pppeum62.sql ├── level02.전화번호_목록 ├── SSSOy.java └── pppeum62.java ├── level02.주식가격 ├── SSSOy.java └── yoojinhee03.java ├── level02.중성화_여부_파악하기 ├── SSSOy.sql ├── areumsheep.sql └── pppeum62.sql ├── level02.짝지어_제거하기 └── SSSOy.java ├── level02.최댓값과_최솟값 ├── SSSOy.java └── areumsheep.js ├── level02.최솟값_만들기 └── SSSOy.java ├── level02.카펫 └── yoojinhee03.java ├── level02.타겟_넘버 └── JiaLee0707.js ├── level02.튜플 └── SSSOy.java ├── level02.프린터 └── SSSOy.java ├── level02.피보나치_수 ├── SSSOy.java └── yoojinhee03.java ├── level02.행렬_테두리_회전하기 └── SSSOy.java ├── level02.행렬의_곱셈 └── SSSOy.java ├── level03.숫자_게임 └── SSSOy.java ├── level03.없어진_기록_찾기 ├── SSSOy.sql ├── areumsheep.sql └── pppeum62.sql ├── level03.오랜_기간_보호한_동물(1) ├── SSSOy.sql ├── areumsheep.sql └── pppeum62.sql ├── level03.오랜_기간_보호한_동물(2) ├── SSSOy.sql ├── areumsheep.sql └── pppeum62.sql ├── level03.이중우선순위큐 └── SSSOy.java ├── level03.있었는데요_없었습니다 ├── SSSOy.sql ├── Suhyeon.sql ├── areumsheep.sql └── pppeum62.sql ├── level03.헤비_유저가_소유한_장소 ├── SSSOy.sql └── pppeum62.sql ├── level04.보호소에서_중성화한_동물 ├── SSSOy.sql ├── areumsheep.sql └── pppeum62.sql ├── level04.우유와_요거트가_담긴_장바구니 ├── SSSOy.sql └── pppeum62.sql └── level04.특정_세대의_대장균_찾기 └── pppeum62.sql /.github/CODEOWNERS: -------------------------------------------------------------------------------- 1 | * @areumsheep @SSSOy @pppeum62 2 | -------------------------------------------------------------------------------- /.github/PULL_REQUEST_TEMPLATE.md: -------------------------------------------------------------------------------- 1 | ## 📅 문제를 푼 날짜 2 | - 2022 3 | 4 | ## 🔗 문제 링크 5 | - 6 | 7 | ## 💬 의견 8 | -------------------------------------------------------------------------------- /baekjoon/1000.A+B/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | class Main { 4 | public static void main(String ar[]) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | int a = sc.nextInt(); 8 | int b = sc.nextInt(); 9 | 10 | System.out.println(a+b); 11 | 12 | sc.close(); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /baekjoon/10171.고양이/Moon-HyeKyung.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() { 3 | printf("\\ /\\\n"); 4 | printf(" ) ( ')\n"); 5 | printf("( / )\n"); 6 | printf(" \\(__)|\n"); 7 | return 0; 8 | } 9 | -------------------------------------------------------------------------------- /baekjoon/10718.We_love_kriii/Moon-HyeKyung.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | for(int i=0; i<2; i++) 5 | printf("강한친구 대한육군\n"); 6 | return 0; 7 | } 8 | -------------------------------------------------------------------------------- /baekjoon/10757.큰_수_A+B/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.math.*; 3 | 4 | public class Main { 5 | public static void main(String[] args) { 6 | Scanner sc = new Scanner(System.in); 7 | 8 | BigInteger n = sc.nextBigInteger(); 9 | BigInteger m = sc.nextBigInteger(); 10 | 11 | System.out.println(n.add(m)); 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /baekjoon/10809.알파벳_찾기/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | String[] alphabet = { "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z" }; 7 | String str = sc.nextLine(); 8 | 9 | sc.close(); 10 | 11 | for(String find : alphabet) { 12 | System.out.print(str.indexOf(find) + " "); 13 | } 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /baekjoon/10818.최소,_최대/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayList; 2 | import java.util.Collections; 3 | import java.util.Scanner; 4 | 5 | public class Main { 6 | public static void main(String[] args) { 7 | Scanner sc = new Scanner(System.in); 8 | 9 | int n = sc.nextInt(); 10 | ArrayList numbers = new ArrayList<>(); 11 | 12 | for(int i = 0; i < n; i++) { 13 | numbers.add(sc.nextInt()); 14 | } 15 | 16 | sc.close(); 17 | 18 | System.out.println(Collections.min(numbers) + " " + Collections.max(numbers)); 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /baekjoon/1085.직사각형에서_탈출/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.lang.Math; 2 | import java.util.Scanner; 3 | 4 | public class Main { 5 | public static void main(String[] args) { 6 | Scanner sc = new Scanner(System.in); 7 | 8 | int x = sc.nextInt(); 9 | int y = sc.nextInt(); 10 | int w = sc.nextInt(); 11 | int h = sc.nextInt(); 12 | 13 | sc.close(); 14 | 15 | int width = Math.min(x, w - x); 16 | int height = Math.min(y, h - y); 17 | 18 | System.out.println(Math.min(width, height)); 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /baekjoon/1110.더하기_사이클/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | int n = sc.nextInt(); 8 | int result = n; 9 | int cnt = 0; 10 | 11 | sc.close(); 12 | 13 | while(true) { 14 | result = ((result % 10) * 10) + (((result / 10) + (result % 10)) % 10); 15 | cnt++; 16 | 17 | if(n == result) break; 18 | } 19 | 20 | System.out.println(cnt); 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /baekjoon/1152.단어의_개수/dayomi02.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | char arr[1000000] = { 0, }; 6 | int WordCnt = 0, SpaceCnt = 0, len; 7 | 8 | gets(arr); 9 | len = strlen(arr); 10 | 11 | for (int i = 0; i < len; i++) { 12 | if (arr[i] == ' ') 13 | SpaceCnt++; 14 | } 15 | 16 | WordCnt = SpaceCnt + 1; 17 | 18 | if (isspace(arr[0]) != 0) { 19 | WordCnt--; 20 | } 21 | if (isspace(arr[len-1]) != 0) { 22 | WordCnt--; 23 | } 24 | 25 | printf("%d\n", WordCnt); 26 | 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /baekjoon/1152.단어의_개수/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | String str = sc.nextLine().trim(); 8 | sc.close(); 9 | 10 | if(str.length() == 0) System.out.println("0"); 11 | else System.out.println(str.split(" ").length); 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /baekjoon/11654.아스키_코드/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | String s = sc.nextLine(); 8 | sc.close(); 9 | 10 | System.out.format("%d", (int)s.charAt(0)); 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /baekjoon/14681.사분면_고르기/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | int x = sc.nextInt(); 8 | int y = sc.nextInt(); 9 | 10 | sc.close(); 11 | 12 | System.out.println(x > 0 ? y > 0 ? 1 : 4 : y > 0 ? 2 : 3); 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /baekjoon/1546.평균/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayList; 2 | import java.util.Collections; 3 | import java.util.Scanner; 4 | 5 | public class Main { 6 | public static void main(String[] args) { 7 | Scanner sc = new Scanner(System.in); 8 | 9 | int n = sc.nextInt(); 10 | ArrayList scores = new ArrayList<>(); 11 | 12 | for(int i = 0; i < n; i++) { 13 | scores.add(sc.nextInt()); 14 | } 15 | 16 | sc.close(); 17 | 18 | double max = Collections.max(scores); 19 | double total = 0; 20 | 21 | for(int i : scores) { 22 | total += i / max * 100; 23 | } 24 | 25 | System.out.println(total / n); 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /baekjoon/15596.정수_N개의_합/pppeum62.java: -------------------------------------------------------------------------------- 1 | public class Test { 2 | long sum(int[] a) { 3 | long ans = 0; 4 | 5 | for(int i : a) { 6 | ans += i; 7 | } 8 | 9 | return ans; 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /baekjoon/18108.1998년생인_내가_태국에서는_2541년생/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | int year = sc.nextInt(); 8 | sc.close(); 9 | 10 | System.out.println(year - 543); 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /baekjoon/25205.경로당펑크_2077/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | // ㅏㅑㅓㅕㅗㅛㅜㅠㅡㅣㅐㅔ 자판의 알파벳 8 | String vowel = "kijuhynbmlop"; 9 | 10 | int n = sc.nextInt(); 11 | String username = sc.next(); 12 | 13 | sc.close(); 14 | 15 | System.out.println(vowel.contains(username.substring(n - 1, n)) ? 0 : 1); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /baekjoon/2557.Hello_World/Moon-HyeKyung.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | printf("Hello World!"); 5 | return 0; 6 | } 7 | 8 | -------------------------------------------------------------------------------- /baekjoon/2562.최댓값/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | int[] numbers = new int[9]; 7 | 8 | numbers[0] = sc.nextInt(); 9 | int max = numbers[0]; 10 | int maxIndex = 0; 11 | 12 | for(int i = 1; i < 9; i++) { 13 | numbers[i] = sc.nextInt(); 14 | if(max < numbers[i]) { 15 | max = numbers[i]; 16 | maxIndex = i; 17 | } 18 | } 19 | 20 | sc.close(); 21 | 22 | System.out.println(max); 23 | System.out.println(maxIndex + 1); 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /baekjoon/2750.수_정렬하기/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayList; 2 | import java.util.Collections; 3 | import java.util.Scanner; 4 | 5 | public class Main { 6 | public static void main(String[] args) { 7 | Scanner sc = new Scanner(System.in); 8 | 9 | ArrayList numbers = new ArrayList<>(); 10 | int n = sc.nextInt(); 11 | 12 | for(int i = 0; i < n; i++) { 13 | numbers.add(sc.nextInt()); 14 | } 15 | 16 | sc.close(); 17 | 18 | Collections.sort(numbers); 19 | 20 | for(int num : numbers) { 21 | System.out.println(num); 22 | } 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /baekjoon/2753.윤년/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | int year = sc.nextInt(); 8 | sc.close(); 9 | 10 | if(year % 4 == 0 && year % 100 != 0 || year % 400 == 0) System.out.println(1); 11 | else System.out.println(0); 12 | 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /baekjoon/2869.달팽이는_올라가고_싶다/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | int up = sc.nextInt(); 8 | int down = sc.nextInt(); 9 | int v = sc.nextInt(); 10 | sc.close(); 11 | 12 | int day = (v - down) / (up - down); 13 | if((v - down) % (up - down) != 0) day++; 14 | 15 | System.out.println(day); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /baekjoon/2884.알람_시계/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | int hour = sc.nextInt(); 8 | int minute = sc.nextInt(); 9 | 10 | if(minute - 45 < 0) { 11 | hour = hour - 1 < 0 ? 23 : hour - 1; 12 | minute = 60 - (45 - minute); 13 | } else { 14 | minute -= 45; 15 | } 16 | 17 | System.out.println(hour + " " + minute); 18 | 19 | sc.close(); 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /baekjoon/2908.상수/dayomi02.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int changeNum(int num) { 4 | int newNum = 0; 5 | 6 | newNum = (num % 10)*100; 7 | newNum += (num - num % 10) % 100; 8 | newNum += num / 100; 9 | 10 | return newNum; 11 | } 12 | 13 | int main() { 14 | 15 | int num1, num2; 16 | 17 | scanf("%d %d", &num1, &num2); 18 | 19 | num1 = changeNum(num1); 20 | num2 = changeNum(num2); 21 | 22 | printf("%d", num1 > num2 ? num1 : num2); 23 | 24 | 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /baekjoon/2908.상수/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | 7 | StringBuffer str1 = new StringBuffer(sc.next()); 8 | StringBuffer str2 = new StringBuffer(sc.next()); 9 | 10 | sc.close(); 11 | 12 | int n = Integer.parseInt(str1.reverse().toString()); 13 | int m = Integer.parseInt(str2.reverse().toString()); 14 | 15 | System.out.println(Math.max(n, m)); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /baekjoon/3460.이진수/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.lang.Integer; 2 | import java.lang.StringBuffer; 3 | import java.util.Scanner; 4 | 5 | public class Main { 6 | public static void main(String[] args) { 7 | Scanner sc = new Scanner(System.in); 8 | 9 | int n = sc.nextInt(); 10 | int num; 11 | String binary; 12 | 13 | for(int i = 0; i < n; i++) { 14 | num = sc.nextInt(); 15 | 16 | binary = Integer.toBinaryString(num); 17 | StringBuffer sb = new StringBuffer(binary); 18 | binary = sb.reverse().toString(); 19 | 20 | for(int j = 0; j < binary.length(); j++) { 21 | j = binary.indexOf("1", j); 22 | System.out.print(j + " "); 23 | } 24 | 25 | System.out.println(); 26 | } 27 | 28 | sc.close(); 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /baekjoon/4344.평균은_넘겠지/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner sc = new Scanner(System.in); 6 | int cnt = sc.nextInt(); 7 | int n; 8 | 9 | for(int i = 0; i < cnt; i++) { 10 | n = sc.nextInt(); 11 | int score[] = new int[n]; 12 | double total = 0; 13 | 14 | for(int j = 0; j < n; j++) { 15 | score[j] = sc.nextInt(); 16 | total += score[j]; 17 | } 18 | 19 | int avgStu = 0; 20 | 21 | for(int j = 0; j < n; j++) { 22 | if(score[j] > total / n) avgStu++; 23 | } 24 | 25 | System.out.println(String.format("%.3f", (double)avgStu / n * 100) + "%"); 26 | } 27 | 28 | sc.close(); 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /baekjoon/README.md: -------------------------------------------------------------------------------- 1 | https://www.acmicpc.net/ -------------------------------------------------------------------------------- /goormedu/알고리즘{먼데이}/[1주차]-1.경로의_개수/areumsheep.js: -------------------------------------------------------------------------------- 1 | // Run by Node.js 2 | const readline = require('readline'); 3 | const rl = readline.createInterface({ input: process.stdin, output: process.stdout }); 4 | let data = []; 5 | 6 | rl.on('line', (line) => { 7 | data.push(line); 8 | 9 | }).on('close', () => { 10 | console.log(solution(data)); 11 | process.exit(); 12 | }); 13 | 14 | const solution = (data) => { 15 | const bridge = data[1].split(' '); 16 | 17 | const sum = bridge.reduce((acc, cur) => { 18 | return acc *= BigInt(cur); 19 | }, 1n).toString(); 20 | return sum; 21 | }; 22 | -------------------------------------------------------------------------------- /goormedu/알고리즘{먼데이}/[1주차]-2.동명이인/areumsheep.js: -------------------------------------------------------------------------------- 1 | // Run by Node.js 2 | const readline = require('readline'); 3 | const rl = readline.createInterface({ input: process.stdin, output: process.stdout }); 4 | let data = []; 5 | 6 | rl.on('line', (line) => { 7 | data.push(line); 8 | 9 | }).on('close', () => { 10 | console.log(solution(data)); 11 | process.exit(); 12 | }); 13 | 14 | const solution = (data) => { 15 | let count = 0; 16 | const firstLine = data.shift(); 17 | const [repeat, standardName] = firstLine.split(' '); 18 | 19 | for (const name of data) { 20 | if (name.includes(standardName)) count++; 21 | } 22 | return count; 23 | }; 24 | 25 | console.log(solution(['4 fred', 'sam', 'fredy', 'fredi', 'ilium'])); 26 | -------------------------------------------------------------------------------- /goormedu/알고리즘{먼데이}/[1주차]-3.최장_맨해튼_거리/areumsheep.js: -------------------------------------------------------------------------------- 1 | // Run by Node.js 2 | const readline = require('readline'); 3 | 4 | (async () => { 5 | let rl = readline.createInterface({ input: process.stdin }); 6 | 7 | for await (const line of rl) { 8 | const point = line.trim().split(' ').map(Number); 9 | point.sort((a,b) => a-b); 10 | 11 | let [x1, y1, y2, x2] = [...point]; 12 | console.log(x2 - x1 + y2 - y1); 13 | rl.close(); 14 | } 15 | 16 | process.exit(); 17 | })(); 18 | -------------------------------------------------------------------------------- /goormedu/알고리즘{먼데이}/[1주차]-4.소수_찾기/areumsheep.js: -------------------------------------------------------------------------------- 1 | // Run by Node.js 2 | const readline = require('readline'); 3 | const rl = readline.createInterface({ input: process.stdin, output: process.stdout }); 4 | let data = []; 5 | 6 | rl.on('line', (line) => { 7 | data.push(line); 8 | 9 | }).on('close', () => { 10 | console.log(solution(data)); 11 | process.exit(); 12 | }); 13 | 14 | const solution = (data) => { 15 | data.shift(); 16 | const numbers = data[0].split(' ').map(Number); 17 | 18 | // 소수 구하기 19 | const result = numbers.reduce((acc, number, index) => { 20 | // index가 만약 소수라면 21 | if (isPrime(index+1)) { 22 | return acc += number; 23 | } 24 | return acc; 25 | }, 0); 26 | 27 | return result; 28 | }; 29 | 30 | const isPrime = (n) => { 31 | if (n < 2) return false; 32 | for (i = 2; i <= Math.sqrt(n); i++) { 33 | if (n % i === 0) return false; 34 | } 35 | return true; 36 | }; 37 | -------------------------------------------------------------------------------- /goormedu/알고리즘{먼데이}/[2주차]-2.철자_분리_집합/areumsheep.js: -------------------------------------------------------------------------------- 1 | // Run by Node.js 2 | const readline = require('readline'); 3 | const rl = readline.createInterface({ input: process.stdin, output: process.stdout }); 4 | const data = []; 5 | 6 | rl.on('line', (line) => { 7 | data.push(line); 8 | 9 | }).on('close', () => { 10 | console.log(solution(data)); 11 | process.exit(); 12 | }); 13 | 14 | const solution = (data) => { 15 | let count = 0; 16 | let beforeWord = ''; 17 | const wordArray = data[1].toLowerCase().split(''); 18 | 19 | wordArray.forEach((cur) => { 20 | if(cur !== beforeWord) count++; 21 | beforeWord = cur; 22 | }) 23 | 24 | return count; 25 | }; 26 | -------------------------------------------------------------------------------- /goormedu/알고리즘{먼데이}/[2주차]-3.출석부/areumsheep.js: -------------------------------------------------------------------------------- 1 | // Run by Node.js 2 | const readline = require('readline'); 3 | const rl = readline.createInterface({ input: process.stdin, output: process.stdout }); 4 | const data = []; 5 | 6 | rl.on('line', (line) => data.push(line)) 7 | .on('close', () => { console.log(solution(data)); process.exit(); }); 8 | 9 | const solution = (data) => { 10 | const [count, index] = data.shift().split(' '); 11 | 12 | data.sort((a, b) => { 13 | const [firstName, firstHeight] = a.split(' '); 14 | const [secondName, secondHeight] = b.split(' '); 15 | 16 | if(firstName < secondName) return -1; 17 | else if(firstName > secondName) return 1; 18 | else return Number(firstHeight) - Number(secondHeight); 19 | }); 20 | 21 | return data[index-1]; 22 | }; 23 | -------------------------------------------------------------------------------- /goormedu/알고리즘{먼데이}/[3주차]-1.0커플/areumsheep.js: -------------------------------------------------------------------------------- 1 | // Run by Node.js 2 | const readline = require('readline'); 3 | const rl = readline.createInterface({ input: process.stdin, output: process.stdout }); 4 | const data = []; 5 | 6 | rl.on('line', (line) => data.push(line)) 7 | .on('close', () => { console.log(solution(data)); process.exit(); }); 8 | 9 | const solution = (data) => { 10 | data.shift(); 11 | const person = data[0].split(' ').map(Number); 12 | return person.reduce((acc, cur) => acc += cur); 13 | }; 14 | -------------------------------------------------------------------------------- /leetcode/Array/1.Two_Sum/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @param {number} target 4 | * @return {number[]} 5 | */ 6 | var twoSum = function (nums, target) { 7 | const search_max = nums.length; 8 | 9 | for (let i = 0; i < search_max; i++) { 10 | for (let j = i + 1; j < search_max; j++) { 11 | if (nums[i] + nums[j] === target) { 12 | return [i, j]; 13 | } 14 | } 15 | } 16 | }; 17 | -------------------------------------------------------------------------------- /leetcode/Array/121.Best_Time_to_Buy_and_Sell_Stock/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} prices 3 | * @return {number} 4 | */ 5 | var maxProfit = function(prices) { 6 | const pricesLen = prices.length; 7 | let minValue = prices[0]; 8 | let profit = 0; 9 | 10 | for(let i = 1; i < pricesLen; i++){ 11 | if(minValue > prices[i]) minValue = prices[i]; 12 | if(prices[i] - minValue > profit) profit = prices[i] - minValue; 13 | } 14 | return profit; 15 | }; 16 | -------------------------------------------------------------------------------- /leetcode/Array/217.Contains_Duplicate/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @return {boolean} 4 | */ 5 | var containsDuplicate = function(nums) { 6 | const uniqueArr = [...new Set(nums)]; 7 | return uniqueArr.length === nums.length ? false : true; 8 | }; 9 | -------------------------------------------------------------------------------- /leetcode/Array/238.Product_of_Array_Except_Self/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @return {number[]} 4 | */ 5 | var productExceptSelf = function(nums) { 6 | let result = []; 7 | const numsLen = nums.length; 8 | const numsArrLen = nums.length -1; 9 | 10 | //value initialization 11 | let frontValue = [1]; 12 | let backValue = []; 13 | backValue[numsArrLen] = 1; 14 | 15 | //calculate 16 | for(let i = 1; i < numsLen; i++){ //1,2,3 17 | frontValue[i] = nums[i-1] * frontValue[i-1]; 18 | } 19 | for(let j = numsArrLen; j >= 0; j--){ 20 | if(numsArrLen !== j) backValue[j] = nums[j+1] * backValue[j+1]; 21 | result[j] = frontValue[j] * backValue[j]; 22 | } 23 | return result; 24 | }; 25 | -------------------------------------------------------------------------------- /leetcode/Array/53.Maximum_Subarray/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @return {number} 4 | */ 5 | const maxSubArray = function(nums) { 6 | const numsLen = nums.length; 7 | for(let i = 1; i< numsLen; i++){ 8 | nums[i] = Math.max(nums[i], nums[i]+nums[i-1]); 9 | } 10 | return Math.max(...nums); 11 | }; 12 | -------------------------------------------------------------------------------- /leetcode/Binary_Search/704.Binary_Search/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {number[]} nums 3 | * @param {number} target 4 | * @return {number} 5 | */ 6 | var search = function(nums, target) { 7 | let left = 0; 8 | let right = nums.length - 1; 9 | 10 | while (left <= right) { 11 | const mid = Math.floor(left + (right - left) / 2) 12 | 13 | if (nums[mid] === target) { 14 | return mid; 15 | } else if (nums[mid] < target) { 16 | left = mid + 1; 17 | } else { 18 | right = mid - 1; 19 | } 20 | } 21 | 22 | return -1; 23 | }; 24 | -------------------------------------------------------------------------------- /leetcode/Linked_List/234.Palindrome_Linked_List/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * Definition for singly-linked list. 3 | * function ListNode(val, next) { 4 | * this.val = (val===undefined ? 0 : val) 5 | * this.next = (next===undefined ? null : next) 6 | * } 7 | */ 8 | /** 9 | * @param {ListNode} head 10 | * @return {boolean} 11 | */ 12 | var isPalindrome = function(head) { 13 | // 없거나 1개일 때 true 리턴 14 | if(!head || !head.next) return true; 15 | 16 | let reverseValue = []; 17 | while(head) { 18 | reverseValue.push(head.val); 19 | head = head.next; 20 | } 21 | 22 | let left = 0, right = reverseValue.length -1; 23 | while(left <= right) { 24 | if(reverseValue[left] !== reverseValue[right]) 25 | return false; 26 | left++; 27 | right--; 28 | } 29 | return true; 30 | }; 31 | -------------------------------------------------------------------------------- /leetcode/Stack/20.Valid_Parentheses/areumsheep.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {boolean} 4 | */ 5 | var isValid = function(s) { 6 | const stack = []; 7 | const map = new Map([ 8 | [')', '('], 9 | [']', '['], 10 | ['}', '{'] 11 | ]); 12 | 13 | for(let bracket of s) { 14 | if(map.has(bracket)) { 15 | if(map.get(bracket) !== stack.pop()) { 16 | return false; 17 | } 18 | } else { 19 | stack.push(bracket); 20 | } 21 | } 22 | 23 | 24 | return stack.length === 0; 25 | }; 26 | -------------------------------------------------------------------------------- /leetcode/String/125.Valid_Palindrome/Leemainsw.js: -------------------------------------------------------------------------------- 1 | /** 2 | * @param {string} s 3 | * @return {boolean} 4 | */ 5 | var isPalindrome = function(s) { 6 | // 받은 string이 빈문자열이라면 true를 반환 7 | if(s.length == 0) return true; 8 | 9 | // 소문자 변경 + 특수문자 및 공백 제거 10 | const regExp = /[ \{\}\[\]\/?.,;:|\)*~`!^\-_+┼<>@\#$%&\ '\"\\(\=]/gi; 11 | const compareString = s.toLowerCase().replace(regExp, ''); 12 | 13 | // string을 array로 변경하여 순서를 바꾸고 다시 string으로 변환 14 | const reverseString = compareString.split("").reverse().join(""); 15 | 16 | // 두 개가 서로 같은지 비교 17 | return compareString === reverseString; 18 | }; 19 | -------------------------------------------------------------------------------- /programmers/README.md: -------------------------------------------------------------------------------- 1 | 코딩테스트 사이트 : https://programmers.co.kr/ 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.2016년/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | char* solution(int a, int b) { 6 | char* dayList[] = { "FRI", "SAT", "SUN", "MON", "TUE", "WED", "THU" }; 7 | int month[12] = { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }; 8 | char* answer = (char*)malloc(sizeof(char)*3); 9 | int count = 0; 10 | 11 | for (int i = 0; i < a - 1; i++) { 12 | count += month[i]; 13 | } 14 | count += b - 1; 15 | 16 | answer = dayList[count%7]; 17 | 18 | return answer; 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.2016년/Moon-HyeKyung.c++: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | string solution(int a, int b) { 5 | string answer = ""; 6 | int month[]={1,2,3,4,5,6,7,8,9,10,11,12}; 7 | int last_day[]={31,29,31,30,31,30,31,31,30,31,30,31}; 8 | 9 | for(int i=0; i<12; i++){ 10 | if(a==month[i]) 11 | { 12 | for(int j=0; j 0); 7 | 8 | return num; 9 | } 10 | 11 | function decimal(n) { 12 | let digit = n.length - 1; 13 | let num = 0; 14 | do { 15 | const themDigit = n.shift(); 16 | num += themDigit * Math.pow(3, digit); 17 | digit--; 18 | }while (n.length > 0); 19 | 20 | return num; 21 | } 22 | 23 | function solution(n) { 24 | // 1 25 | // var answer = 0; 26 | // const ternaryNum = ternary(n); 27 | // answer = decimal(ternaryNum); 28 | 29 | // return answer; 30 | 31 | 32 | //2 33 | return parseInt(n.toString(3).split('').reverse().join(''), 3); 34 | } 35 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.3진법_뒤집기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | return Number.parseInt(n.toString(3).split("").reverse().join(''),3); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.3진법_뒤집기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n) { 3 | int answer = 0; 4 | String st = ""; 5 | 6 | while(n != 0) { 7 | st += n % 3; 8 | n /= 3; 9 | } 10 | 11 | int i = (int)Math.pow(3, st.length() - 1); 12 | for(char ch : st.toCharArray()) { 13 | answer += (ch - 48) * i; 14 | i /= 3; 15 | } 16 | 17 | return answer; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.3진법_뒤집기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | answer = 0 3 | st = "" 4 | 5 | while n > 0 : 6 | st = st + str(int(n % 3)) 7 | n = int(n / 3) 8 | 9 | n = 1 10 | 11 | for i in range(len(st), 0, -1) : 12 | answer = answer + int(st[i - 1]) * n 13 | n = n * 3 14 | 15 | return answer 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.3진법_뒤집기/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | const result = []; 3 | const NOTATION = 3; // n진법 4 | 5 | //10진법 > n진법 변환 6 | while(n > 0) { 7 | result.push(n % NOTATION); 8 | n = parseInt(n / NOTATION); 9 | } 10 | 11 | //앞뒤 반전 12 | result.reverse(); 13 | 14 | //n진법 > 10진법 변환 15 | return result.reduce((prev, cur, index) => { 16 | return prev + (NOTATION ** index) * cur; 17 | }); 18 | } 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.3진법_뒤집기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | return parseInt(n.toString(3).split('').reverse().join(''), 3); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.K번째수/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(array, commands) { 2 | var answer = []; 3 | 4 | for(const command of commands) { 5 | const themArray = array.slice(command[0] - 1, command[1]).sort((a, b) => a - b); 6 | answer.push(themArray[command[2] - 1]); 7 | } 8 | 9 | return answer; 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.K번째수/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(array, commands) { 2 | return commands.map(command => array.slice(command[0]-1,command[1]).sort((a,b) => a-b)[command[2]-1]); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.K번째수/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | 3 | class Solution { 4 | public int[] solution(int[] array, int[][] commands) { 5 | int[] answer = new int[commands.length]; 6 | 7 | for(int i = 0; i < commands.length; i++) { 8 | int a = commands[i][0]; 9 | int b = commands[i][1]; 10 | int c = commands[i][2]; 11 | int arr[] = new int[b - a + 1]; 12 | 13 | for(int j = a - 1; j < b; j++) 14 | arr[j - a + 1] = array[j]; 15 | 16 | Arrays.sort(arr); 17 | answer[i] = arr[c - 1]; 18 | } 19 | 20 | return answer; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.K번째수/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(array, commands): 2 | answer = [] 3 | 4 | for i in commands : 5 | list = array[i[0] - 1 : i[1]] 6 | list.sort() 7 | answer.append(list[i[2] - 1]) 8 | 9 | return answer 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.K번째수/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(array, commands) { 2 | const INDEX_GAP = 1; 3 | const result = []; 4 | 5 | 6 | for(const command of commands){ 7 | const [start, end, index] = command; 8 | 9 | const copy_array = [...array]; 10 | const splice_array = copy_array.slice(start - INDEX_GAP, end); 11 | splice_array.sort((a, b) => a - b); 12 | 13 | result.push(splice_array[index - INDEX_GAP]); 14 | } 15 | 16 | return result; 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.K번째수/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(array, commands) { 2 | let answer = []; 3 | 4 | for (let i in commands) { 5 | answer.push(array.slice(commands[i][0] - 1, commands[i][1]).sort((a, b) => a - b).slice(commands[i][2] - 1, commands[i][2])[0]); 6 | } 7 | 8 | return answer; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.K번째수/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | 2 | 3 | import java.util.*; 4 | 5 | public class yoojinhee03 { 6 | 7 | public static void main(String[] args) { 8 | 9 | int [] array= {1,5,2,6,3,7,4}; 10 | int [][] commands= {{2,5,3},{4,4,1},{1,7,3}}; 11 | 12 | for(int i:solution(array,commands)) { 13 | System.out.print(i+" "); 14 | } 15 | } 16 | public static int[] solution(int[] array, int[][] commands) { 17 | int[] answer = new int[commands.length]; 18 | for(int i=0; i value.toString(2)); 5 | arr2 = arr2.map((value) => value.toString(2)); 6 | 7 | for(let i=0; i= width ? n : new Array(width - n.length + 1).join('0') + n; 4 | } 5 | 6 | function solution(n, arr1, arr2) { 7 | var answer = []; 8 | 9 | for (var i = 0; i < n; i++) { 10 | var map = addZero((arr1[i] | arr2[i]).toString(2), n); 11 | var temp = ""; 12 | for (var j = 0; j < n; j++) { 13 | temp += map.substring(j, j+1) === "1" ? "#" : " "; 14 | } 15 | answer.push(temp); 16 | } 17 | 18 | return answer; 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.[1차]_비밀지도/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class Solution { 3 | public String[] solution(int n, int[] arr1, int[] arr2) { 4 | String[] answer = new String[n]; 5 | String[] results=new String[n]; 6 | int result; 7 | for(int i=0; i x * (value + 1)) 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.x만큼_간격이_있는_n개의_숫자/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(x, n) { 2 | n+=1; 3 | return Array(n-1).fill(x).map((arg)=> arg*(n-=1)).reverse(); 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.x만큼_간격이_있는_n개의_숫자/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public List solution(long x, long n) { 5 | List answer = new ArrayList(); 6 | long m = x; 7 | 8 | while(n > 0) { 9 | answer.add(m); 10 | m += x; 11 | n--; 12 | } 13 | 14 | return answer; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.x만큼_간격이_있는_n개의_숫자/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(x, n): 2 | return [x * i for i in range(1, n + 1)] 3 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.x만큼_간격이_있는_n개의_숫자/pppeum62.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public long[] solution(long x, int n) { 3 | long[] answer = new long[n]; 4 | 5 | for (int i = 0; i < n; i++) { 6 | answer[i] = x * (i + 1); 7 | } 8 | 9 | return answer; 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.x만큼_간격이_있는_n개의_숫자/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(x, n) { 2 | var answer = []; 3 | 4 | for (var i = 1; i <= n; i++) { 5 | answer.push(x * i); 6 | } 7 | 8 | return answer; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.x만큼_간격이_있는_n개의_숫자/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class yoojinhee03 { 4 | 5 | public static void main(String[] args) { 6 | 7 | for(long i:solution(2,5)) { 8 | System.out.print(i+" "); 9 | } 10 | } 11 | public static long[] solution(int x, int n) { 12 | long[] answer = new long[n]; 13 | for(int i=0; i 2 | #include 3 | #include 4 | 5 | char* solution(const char* s) { 6 | char* answer = (char*)malloc(2); 7 | memset(answer, 0, sizeof(int)*2); 8 | 9 | int size = (int) strlen(s); 10 | 11 | if(size%2==0) { 12 | *answer = s[size/2 - 1]; 13 | *(answer+1) = s[size/2]; 14 | } else { 15 | *answer = s[size/2]; 16 | } 17 | 18 | return answer; 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/JiaLee0707.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(String s) { 3 | String answer = ""; 4 | int len = s.length(); 5 | 6 | if(len%2==0) answer = s.substring(len/2-1, len/2+1); 7 | else answer = s.substring(len/2, len/2+1); 8 | return answer; 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | return s.length % 2 ? s.charAt(s.length/2): s.substr(s.length/2-1,2); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(String s) { 3 | String answer = ""; 4 | int len = s.length(); 5 | 6 | answer = len % 2 == 0? s.substring(len / 2 - 1, len / 2 + 1) : s.substring(len / 2, len / 2 + 1); 7 | 8 | return answer; 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(s): 2 | length = len(s) 3 | if length % 2 == 0 : 4 | return s[int(length / 2) - 1 : int(length / 2) + 1] 5 | return s[int(length / 2)] 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/pppeum62.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(String s) { 3 | int sLen = s.length(); 4 | 5 | return sLen % 2 == 0 ? s.substring(sLen / 2 - 1, sLen / 2 + 1) : s.substring(sLen / 2, sLen / 2 + 1); 6 | } 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | let answer = ''; 3 | let len = s.length; 4 | let index = Math.floor(len / 2); 5 | 6 | if(len % 2 == 0) { 7 | answer = s.substr(index - 1, 2); 8 | } else { 9 | answer = s.substr(index, 1); 10 | } 11 | 12 | return answer; 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/suhyeon.java: -------------------------------------------------------------------------------- 1 | class suhyeon { 2 | public String suhyeon(String s) { 3 | String answer = ""; 4 | int size=s.length(); 5 | 6 | if(size%2==0){ 7 | size=size/2; 8 | answer=s.substring(size-1, size+1); 9 | } 10 | else{ 11 | size=size/2; 12 | answer=s.substring(size, size+1); 13 | } 14 | 15 | return answer; 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/yeeun.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | var answer = ''; 3 | var s_length = s.length; 4 | if(s_length%2==0){ //짝수일때 5 | answer = s.substr(s_length/2-1,2); 6 | }else{ //홀수일때 7 | answer = s.substr(s_length/2,1); 8 | } 9 | 10 | return answer; 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.가운데_글자_가져오기/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.lang.*; 2 | class yoojinhee03 { 3 | public String solution(String s) { 4 | int length=s.length(); 5 | if(length%2==1) return s.substring(length/2,length/2+1); 6 | else return s.substring(length/2-1,length/2+1); 7 | } 8 | } -------------------------------------------------------------------------------- /programmers/난이도별/level01.같은_숫자는_싫어/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(arr) { 2 | return arr.filter((r, index) => r !== arr[index + 1]); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.같은_숫자는_싫어/Moon-HyeKyung.js: -------------------------------------------------------------------------------- 1 | function solution(arr) 2 | { 3 | return arr.filter((el,idx)=> el !== arr[idx-1]); 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.같은_숫자는_싫어/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Solution { 4 | public List solution(int []arr) { 5 | 6 | List answer = new ArrayList(); 7 | answer.add(arr[0]); 8 | 9 | for(int i = 1; i < arr.length; i++) { 10 | if(arr[i] != arr[i - 1]) 11 | answer.add(arr[i]); 12 | } 13 | 14 | return answer; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.같은_숫자는_싫어/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(arr): 2 | answer = [] 3 | idx = -1 4 | 5 | for i in arr : 6 | if idx == -1 : 7 | answer.append(i) 8 | idx = idx + 1 9 | continue 10 | if answer[idx] != i : 11 | answer.append(i) 12 | idx = idx + 1 13 | 14 | return answer 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.같은_숫자는_싫어/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class Solution { 4 | public List solution(int []arr) { 5 | final List answer = new ArrayList(List.of(arr[0])); 6 | 7 | for (int i = 1; i < arr.length; i++) { 8 | if (arr[i] != arr[i - 1]) 9 | answer.add(arr[i]); 10 | } 11 | 12 | return answer; 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.같은_숫자는_싫어/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(arr) 2 | { 3 | let answer = []; 4 | 5 | answer.push(arr[0]); 6 | 7 | for(let i = 1; i < arr.length; i++) { 8 | if(answer[answer.length - 1] != arr[i]) { 9 | answer.push(arr[i]); 10 | } 11 | } 12 | 13 | return answer; 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.같은_숫자는_싫어/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | package programmers; 2 | 3 | import java.util.ArrayList; 4 | 5 | public class yoojinhee03 { 6 | 7 | public static void main(String[] args) { 8 | int[] arr= {1,1,3,3,0,1,1}; 9 | for(int i:solution(arr)) { 10 | System.out.print(i+" "); 11 | } 12 | } 13 | 14 | public static int[] solution(int []arr) { 15 | 16 | ArrayList arrayList = new ArrayList<>(); 17 | arrayList.add(arr[0]); 18 | for(int i=1; i value % divisor === 0); 3 | return answer.length > 0 ? answer.sort((value1, value2) => value1 - value2) : [-1]; 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.나누어_떨어지는_숫자배열/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(arr, divisor) { 2 | arr = arr.filter((element) => element%divisor === 0) 3 | return arr.length > 0 ? arr.sort((a,b)=>a-b) : [-1]; 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.나누어_떨어지는_숫자배열/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public int[] solution(int[] arr, int divisor) { 5 | List answer = new ArrayList(); 6 | Arrays.sort(arr); 7 | 8 | for(int i : arr) { 9 | if(i % divisor == 0) 10 | answer.add(i); 11 | } 12 | if(answer.size() == 0) 13 | answer.add(-1); 14 | 15 | return answer.stream().mapToInt(Integer::intValue).toArray(); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.나누어_떨어지는_숫자배열/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(arr, divisor): 2 | arr.sort() 3 | answer = [i for i in arr if i % divisor == 0] 4 | if not answer : 5 | answer = [-1] 6 | return answer 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.나누어_떨어지는_숫자배열/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(arr, divisor) { 2 | let answer = []; 3 | 4 | for(let i = 0; i < arr.length; i++) { 5 | if(arr[i] % divisor === 0) 6 | answer.push(arr[i]); 7 | } 8 | 9 | if(answer.length < 1) { 10 | answer.push(-1); 11 | } else { 12 | answer.sort(function (a, b) { 13 | return a - b; 14 | }); 15 | } 16 | 17 | return answer; 18 | } 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.나머지가_1이_되는_수_찾기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | var answer = n - 1; 3 | for(let i=2; i 2 | #include 3 | #include 4 | 5 | int solution(int a[], size_t a_len, int b[], size_t b_len) { 6 | int answer = 0; 7 | 8 | for(int i=0; i value * b[index]).reduce((previous, current) => previous + current); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.내적/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int[] a, int[] b) { 3 | int answer = innerProduct(a, b, a.length - 1); 4 | return answer; 5 | } 6 | public int innerProduct(int[] a, int b[], int n) { 7 | if(n == 0) 8 | return a[n] * b[n]; 9 | return a[n] * b[n] + innerProduct(a, b, n - 1); 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.내적/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(a, b): 2 | answer = [] 3 | 4 | for i in range(0, len(a)) : 5 | answer.append(a[i] * b[i]) 6 | 7 | return sum(answer) 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.내적/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(a, b) { 2 | var answer = 0; 3 | // const max_len = a.length; 4 | // for(let i=0; i< max_len; i++){ 5 | // answer += a[i] * b[i] 6 | // } 7 | answer = a.reduce((sum, _, idx) => sum += a[idx] * b[idx], 0); 8 | return answer; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.내적/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(a, b) { 2 | var answer = 0; 3 | 4 | for (var i in a) { 5 | answer += a[i] * b[i]; 6 | } 7 | 8 | return answer; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.내적/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(a, b) { 2 | return a.reduce((sum, a, i) => sum += a * b[i], 0); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.동물의_아이디와_이름/Moon-Hyekyung.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name FROM animal_ins ORDER BY animal_id; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.동물의_아이디와_이름/Suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name FROM animal_ins ORDER BY animal_id; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.동물의_아이디와_이름/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME FROM ANIMAL_INS ORDER BY ANIMAL_ID ASC; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.동물의_아이디와_이름/heena.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name FROM animal_ins ORDER BY animal_id; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.동물의_아이디와_이름/yoojinhee03.sql: -------------------------------------------------------------------------------- 1 | -- 코드를 입력하세요 2 | SELECT ANIMAL_ID,NAME FROM ANIMAL_INS ORDER BY ANIMAL_ID; -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_개_뽑아서_더하기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | let answer = []; 3 | const numbers_length = numbers.length; 4 | 5 | for(let i=0; i a - b); 13 | 14 | return answer; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_개_뽑아서_더하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public TreeSet solution(int[] numbers) { 5 | TreeSet answer = new TreeSet<>(); 6 | 7 | for(int i = 0; i < numbers.length; i++) { 8 | for(int j = i + 1; j < numbers.length; j++) { 9 | answer.add(numbers[i] + numbers[j]); 10 | } 11 | } 12 | 13 | return answer; 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_개_뽑아서_더하기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(numbers): 2 | answer = set() 3 | 4 | for i in range(0, len(numbers)) : 5 | for j in range(i + 1, len(numbers)) : 6 | answer.add(numbers[i] + numbers[j]) 7 | 8 | return sorted(answer) 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_개_뽑아서_더하기/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | let answer = []; 3 | let numLen = numbers.length; 4 | let sum = 0; 5 | 6 | for(let i = 0; i a - b) 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_개_뽑아서_더하기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | var answer = []; 3 | 4 | for (var i in numbers) { 5 | for (var j in numbers) { 6 | if (i === j) { 7 | continue; 8 | } 9 | 10 | answer.push(numbers[i] + numbers[j]); 11 | } 12 | } 13 | 14 | answer = Array.from(new Set(answer)); 15 | 16 | return answer.sort((a, b) => a - b); 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_개_뽑아서_더하기/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class Solution { 3 | public static int[] solution(int[] numbers) { 4 | int[] answer = {}; 5 | //Arrays.sort(numbers); 6 | TreeSet treeSet = new TreeSet<>(); 7 | for(int i=0, num_length=numbers.length; i it = treeSet.iterator(); // ¹Ýº¹ÀÚ »ý¼º 14 | for(int i=0; i 2 | #include 3 | #include 4 | 5 | long long solution(int a, int b) { 6 | long long answer = 0; 7 | int temp; 8 | 9 | if (a >= b) { 10 | temp = a; 11 | a = b; 12 | b = temp; 13 | } 14 | for (int i = a; i <= b; i++) { 15 | answer += i; 16 | } 17 | 18 | return answer; 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/JiaLee0707.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public long solution(int a, int b) { 3 | long answer = b; 4 | int z = 1; 5 | if(a > b) z = -1; 6 | for(int i=a; i!=b; i+=z) { 7 | answer += i; 8 | } 9 | 10 | return answer; 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public long solution(int a, int b) { 3 | long answer = 0; 4 | for(long i = (a < b? a : b); i <= (a > b? a : b); i++) 5 | answer += i; 6 | return answer; 7 | } 8 | } 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(a, b): 2 | if a > b : 3 | return sum(range(b, a + 1)) 4 | return sum(range(a, b + 1)) 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/areumsheep.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public long solution(int a, int b) { 3 | long answer = 0; 4 | int temp = 0; 5 | 6 | if(a>b) { 7 | temp = b; 8 | b = a; 9 | a = temp; 10 | } 11 | 12 | for(int i=a; i<=b; i++) 13 | answer += i; 14 | 15 | return answer; 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(a, b) { 2 | let answer = 0; 3 | let temp; 4 | 5 | if(a > b) { 6 | temp = b; 7 | b = a; 8 | a = temp; 9 | } 10 | 11 | for(let i = a; i <= b; i++) { 12 | answer += i; 13 | } 14 | 15 | return answer; 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/suhyeon.java: -------------------------------------------------------------------------------- 1 | class Suhyeon { 2 | public long Suhyeon(int a, int b) { 3 | long answer = 0; 4 | int max = 0, min =0; 5 | 6 | if(a>b){ 7 | max = a; min =b; 8 | } 9 | else { 10 | max = b; min = a; 11 | } 12 | 13 | for(int i = min; i <= max; i++){ 14 | answer += i; 15 | } 16 | 17 | 18 | return answer; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/yeeun.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | long long solution(int a, int b) { 6 | long long answer = 0; 7 | int temp; 8 | if(a>b) 9 | { 10 | temp = a; 11 | a = b; 12 | b = temp; 13 | } 14 | 15 | for(int i=a; i<=b; i++) 16 | { 17 | answer += i; 18 | } 19 | return answer; 20 | } 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.두_정수_사이의_합/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | package programmers; 2 | 3 | 4 | public class yoojinhee03 { 5 | 6 | public static void main(String[] args) { 7 | int[] arr= {1,1,3,3,0,1,1}; 8 | System.out.println(solution(3,5)); 9 | } 10 | 11 | public static long solution(int a, int b) { 12 | long answer = 0; 13 | 14 | for(int i=a>b?b:a; i<=(a>b?a:b); i++) { 15 | answer+=i; 16 | } 17 | return answer; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.로또의_최고_순위와_최저_순위/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[] solution(int[] lottos, int[] win_nums) { 3 | int[] answer = {0, 0}; 4 | int match_max = 0; 5 | int match_min = 0; 6 | 7 | for(int i = 0; i < 6; i++) { 8 | if(lottos[i] == 0) { 9 | match_max++; 10 | continue; 11 | } 12 | for(int j = 0; j < 6; j++) { 13 | if(lottos[i] == win_nums[j]) { 14 | match_max++; 15 | match_min++; 16 | } 17 | } 18 | } 19 | 20 | answer[0] = match_max != 0? 7 - match_max : 6; 21 | answer[1] = match_min != 0? 7 - match_min : 6; 22 | return answer; 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.로또의_최고_순위와_최저_순위/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(lottos, win_nums) { 2 | var answer = []; 3 | let min = 0, max = 0; 4 | min = lottos.filter(num => win_nums.includes(num)).length; 5 | max = lottos.filter(num => num === 0).length + min; 6 | 7 | answer.push(max > 1 ? 7-(max) : 6); 8 | answer.push(min > 1 ? 7-(min) : 6); 9 | 10 | return answer; 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.로또의_최고_순위와_최저_순위/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(lottos, win_nums) { 2 | var answer = []; 3 | var success = 0; 4 | var zero = lottos.filter(e => 0 === e).length; 5 | 6 | for (var n in lottos) { 7 | if (win_nums.indexOf(lottos[n]) != -1) success++; 8 | } 9 | 10 | var best = success + zero; 11 | var worst = success; 12 | 13 | answer.push(best < 2 ? 6 : 7 - best); 14 | answer.push(worst < 2 ? 6 : 7 - worst); 15 | 16 | return answer; 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.로또의_최고_순위와_최저_순위/pppeum62.kt: -------------------------------------------------------------------------------- 1 | class Solution { 2 | fun solution(lottos: IntArray, win_nums: IntArray): IntArray { 3 | var success = 0 4 | var zero = lottos.count { it === 0 } 5 | win_nums.forEach { it -> if (lottos.indexOf(it) != -1) success++ } 6 | 7 | var best = success + zero 8 | var worst = success 9 | 10 | fun rank(n: Int) : Int = if (n < 2) 6 else 7 - n 11 | 12 | return intArrayOf(rank(best), rank(worst)) 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.모의고사/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(answers): 2 | answer = [] 3 | score = [0, 0, 0] 4 | st1 = [1, 2, 3, 4, 5] 5 | st2 = [2, 1, 2, 3, 2, 4, 2, 5] 6 | st3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5] 7 | 8 | for idx, value in enumerate(answers) : 9 | if (value == st1[idx % len(st1)]) : 10 | score[0] += 1 11 | if (value == st2[idx % len(st2)]) : 12 | score[1] += 1 13 | if (value == st3[idx % len(st3)]) : 14 | score[2] += 1 15 | 16 | for idx, value in enumerate(score) : 17 | if (value == max(score)) : 18 | answer.append(idx + 1) 19 | 20 | return answer 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.모의고사/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(answers) { 2 | let a = [1, 2, 3, 4, 5]; //5 3 | let b = [2, 1, 2, 3, 2, 4, 2, 5]; //8 4 | let c = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]; //10 5 | let cnt = [0,0,0]; 6 | 7 | for(var i=0; i { 3 | switch(currentValue) { 4 | case 'P': case 'p': { 5 | return accumulator += 1; 6 | } 7 | case 'Y': case 'y': { 8 | return accumulator -= 1; 9 | } 10 | default: { 11 | return accumulator; 12 | } 13 | } 14 | }, 0) 15 | return countOfPAndY === 0 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_p와_y의_개수/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | boolean solution(String s) { 3 | boolean answer = false; 4 | int cnt[]={0, 0}; 5 | s = s.toLowerCase(); 6 | 7 | for(int i = 0; i < s.length(); i++) { 8 | char a = s.charAt(i); 9 | cnt[0] = a == 'y'? cnt[0] + 1 : cnt[0]; 10 | cnt[1] = a == 'p'? cnt[1] + 1 : cnt[1]; 11 | } 12 | if(cnt[0] == cnt[1]) 13 | answer = true; 14 | 15 | return answer; 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_p와_y의_개수/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(s): 2 | return s.upper().count('P') == s.upper().count('Y') 3 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_p와_y의_개수/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(s){ 2 | 3 | let pResult = s.match(/p/gi); 4 | let yResult = s.match(/y/gi); 5 | 6 | if (!pResult && !yResult) return true; 7 | else if (!pResult || !yResult) return false; 8 | else if (pResult.length === yResult.length) return true; 9 | 10 | return false; 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_p와_y의_개수/suhyeon.js: -------------------------------------------------------------------------------- 1 | function suhyeon(s){ 2 | var pExp = /p/gi; 3 | var yExp = /y/gi; 4 | 5 | var pResult = s.match(pExp); 6 | var yResult = s.match(yExp); 7 | 8 | if(pResult.length == yResult.length){ 9 | return true; 10 | } 11 | return false; 12 | } 13 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_p와_y의_개수/yeeun.js: -------------------------------------------------------------------------------- 1 | function solution(s){ 2 | var answer = true; 3 | 4 | s = s.toUpperCase(); 5 | var result1 = s.match(/P/g); //정규식 형태를 통해서 'P'라는 문자를 추출해 배열로 담는다. 6 | var result2 = s.match(/Y/g); //이때, g는 global을 의미함. 7 | 8 | if(result1 == null || result2 == null){ 9 | answer = false; 10 | }else if(result1.length==result2.length){ 11 | answer = true; 12 | }else{ 13 | answer = false; 14 | } 15 | 16 | return answer; 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_p와_y의_개수/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | package programmers; 2 | 3 | import java.util.ArrayList; 4 | import java.util.Arrays; 5 | 6 | public class yoojinhee03 { 7 | 8 | public static void main(String[] args) { 9 | int[] arr= {1,2,3,4,5}; 10 | System.out.println(solution("pPyyY")); 11 | 12 | } 13 | 14 | static boolean solution(String s) { 15 | 16 | s=s.toUpperCase(); 17 | int cnt=0; 18 | String arr[]=s.split(""); 19 | for(String str:arr) 20 | cnt= str.equals("P")?cnt+1:str.equals("Y")?cnt-1:cnt+0; 21 | if(cnt==0) return true; 22 | else return false; 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_마음대로_정렬하기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function comparison(value1, value2) { 2 | if (value1 < value2) return -1; 3 | else if (value1 > value2) return 1; 4 | else return 0 5 | } 6 | 7 | function solution(strings, n) { 8 | // 1 9 | // return strings.sort((value1, value2) => { 10 | // let result = comparison(value1[n], value2[n]); 11 | // return result !== 0 ? result : comparison(value1, value2); 12 | // }); 13 | 14 | // 2 15 | return strings.sort((value1, value2) => value1[n] !== value2[n] ? value1[n].localeCompare(value2[n]) : value1.localeCompare(value2)); 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_마음대로_정렬하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(strings, n) { 2 | strings.sort((a,b)=> { 3 | if(a[n] === b[n]) return a < b ? -1 : 1 4 | return a[n] < b[n] ? -1 : 1 5 | }) 6 | return strings 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_마음대로_정렬하기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(strings, n): 2 | strings.sort(key = lambda e: (e[n], e)) 3 | return strings 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_마음대로_정렬하기/areum.js: -------------------------------------------------------------------------------- 1 | function solution(strings, n) { 2 | return strings.sort(function(a,b){ 3 | if(a[n] > b[n]) return 1; 4 | if(a[n] < b[n]) return -1; 5 | if(a[n] === b[n]) return a.localeCompare(b); 6 | }); 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내_마음대로_정렬하기/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | 3 | class Solution { 4 | public String[] solution(String[] strings, int n) { 5 | String[] answer = new String[strings.length]; 6 | 7 | for (int i = 0; i < strings.length; i++) { 8 | answer[i] = strings[i].substring(n, n + 1) + strings[i]; 9 | } 10 | 11 | Arrays.sort(answer); 12 | 13 | for (int i = 0; i < strings.length; i++) { 14 | answer[i] = answer[i].substring(1); 15 | } 16 | 17 | return answer; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내림차순으로_배치하기/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | char* solution(const char* s) { 6 | int size = (int)strlen(s); 7 | char* answer = (char*)malloc(sizeof(char) * size); 8 | 9 | strcpy(answer, s); 10 | 11 | for(int i=0; i (int)answer[i]) { 14 | char temp = answer[j]; 15 | answer[j] = answer[i]; 16 | answer[i] = temp; 17 | } 18 | } 19 | } 20 | answer[size] = '\0'; 21 | 22 | return answer; 23 | } 24 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내림차순으로_배치하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | return s.split('').sort((a,b)=> a > b ? -1 : 1).join(''); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내림차순으로_배치하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public String solution(String s) { 5 | String answer = ""; 6 | char arr[] = s.toCharArray(); 7 | Arrays.sort(arr); 8 | 9 | for(int i = arr.length - 1; i >= 0; i--) 10 | answer += arr[i]; 11 | 12 | return answer; 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내림차순으로_배치하기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(s): 2 | answer = sorted(list(s), reverse = True) 3 | return ''.join(answer) 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내림차순으로_배치하기/areum.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | var answer = s.split('').sort().reverse().join(''); 3 | return answer; 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내림차순으로_배치하기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | return s.split('').sort().reverse().join(''); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_내림차순으로_배치하기/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | return s.split("").sort((a, b) => b.charCodeAt() - a.charCodeAt()).join(""); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_다루기_기본/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | const regex = /^[0-9]+$/ 3 | return regex.test(s) ? [4,6].includes(s.length): false 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_다루기_기본/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(s): 2 | answer = False 3 | if len(s) == 4 or len(s) == 6 : 4 | answer = s.isnumeric() 5 | return answer 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_다루기_기본/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | return (s.length === 4 || s.length === 6) && /^[0-9]+$/.test(s) ? true : false; 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열_다루기_기본/yeeun.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | var answer = true; 3 | var rglarExp = {containsNumber: /^[0-9]+$/} 4 | //다른 간단한 정규식 : /^\d{6}$|^\d{4}$/ 5 | if(s.length===4||s.length===6){ 6 | answer = rglarExp.containsNumber.test(s); 7 | }else{ 8 | answer=false; 9 | } 10 | return answer; 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열을_정수로_바꾸기/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int solution(const char* s) { 6 | int answer = 0; 7 | // answer = atoi(s); 8 | 9 | int sign = 1; 10 | int i = 0; 11 | 12 | if (s[0] == '-') { 13 | sign = -1; 14 | i = 1; 15 | } 16 | else if (s[0] == '+') { 17 | i = 1; 18 | } 19 | 20 | while(s[i] != '\0') { 21 | answer = answer * 10 + (s[i] - 48); 22 | i++; 23 | } 24 | 25 | answer *= sign; 26 | 27 | return answer; 28 | } 29 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열을_정수로_바꾸기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | return s*1 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.문자열을_정수로_바꾸기/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class yoojinhee03 { 4 | 5 | public static void main(String[] args) { 6 | System.out.println(solution("-1234")); 7 | 8 | } 9 | public static int solution(String s) { 10 | return Integer.parseInt(s); 11 | } 12 | } 13 | 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.부족한_금액_계산하기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(price, money, count) { 2 | let answer = 0; 3 | for(let i=1; i<=count; i++) { 4 | answer += price*i; 5 | } 6 | 7 | answer = (answer >= money ? answer -= money : 0); 8 | 9 | return answer; 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.부족한_금액_계산하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(price, money, count) { 2 | let sum = 0; 3 | for(let index = 1; index <=count; index++ ) { 4 | sum += price * index; 5 | } 6 | 7 | return sum <= money ? 0 : sum - money; 8 | } 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.부족한_금액_계산하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public long solution(int price, int money, int count) { 3 | long answer = 0; 4 | long priceSum = price; 5 | 6 | for(int i = 2; i <= count; i++) 7 | priceSum += (price * i); 8 | 9 | answer = money - priceSum > 0? 0 : (money - priceSum) * (-1); 10 | 11 | return answer; 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.부족한_금액_계산하기/pppeum62.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public long solution(int price, int money, int count) { 3 | long answer = price; 4 | 5 | for (int i = 2; i <= count; i++) { 6 | answer += price * i; 7 | } 8 | 9 | return answer > money ? answer - money : 0; 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.부족한_금액_계산하기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(price, money, count) { 2 | var answer = price; 3 | 4 | for (var i = 2; i <= count; i++) { 5 | answer += price * i; 6 | } 7 | 8 | return answer > money ? answer - money : 0; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.부족한_금액_계산하기/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(price, money, count) { 2 | let answer = -1; 3 | 4 | for (let i = 1; i <= count; i++) { 5 | money -= price * i; 6 | } 7 | 8 | return money >= 0 ? 0 : answer * money; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.삼총사/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | const threeMusketeers = (members, candidates) => { 2 | let answer = 0; 3 | const membersLength = members.length; 4 | 5 | if (membersLength > 2) { 6 | const sum = members.reduce((acc, cur) => acc + cur, 0); 7 | return sum === 0; 8 | } 9 | 10 | candidates.forEach((newMember, index) => { 11 | answer += threeMusketeers([...members, newMember], candidates.slice(0, index)); 12 | }); 13 | 14 | return answer; 15 | } 16 | 17 | function solution(number) { 18 | return threeMusketeers([], number); 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.상위_n개_레코드/Suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT name FROM ANIMAL_INS 2 | WHERE DATETIME = (SELECT MIN(DATETIME) from ANIMAL_INS); 3 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.서울에서_김서방_찾기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(seoul) { 2 | return `김서방은 ${seoul.indexOf('Kim')}에 있다`; 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.서울에서_김서방_찾기/Moon-HyeKyung.js: -------------------------------------------------------------------------------- 1 | const solution = (seoul) => "김서방은 " + seoul.findIndex((a) => a === "Kim") + "에 있다" 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.서울에서_김서방_찾기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(String[] seoul) { 3 | 4 | for(int i = 0; i < seoul.length; i++) 5 | if(seoul[i].equals("Kim")) 6 | return "김서방은 " + i + "에 있다"; 7 | 8 | return ""; 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.서울에서_김서방_찾기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(seoul): 2 | return "김서방은 " + str(seoul.index("Kim")) + "에 있다" 3 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.서울에서_김서방_찾기/Suhyeon.js: -------------------------------------------------------------------------------- 1 | function solution(seoul) { 2 | return '김서방은 '+seoul.indexOf('Kim')+'에 있다'; 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.서울에서_김서방_찾기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(seoul) { 2 | let answer = ''; 3 | let index = seoul.indexOf('Kim'); 4 | 5 | answer = "김서방은 " + index + "에 있다"; 6 | 7 | return answer; 8 | } 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.서울에서_김서방_찾기/yeeun.js: -------------------------------------------------------------------------------- 1 | function solution(seoul) { 2 | var index = seoul.indexOf('Kim'); 3 | return "김서방은 "+index+"에 있다"; 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.소수_만들기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int[] nums) { 3 | int answer = 0; 4 | 5 | for(int i = 0; i < nums.length; i++) { 6 | for(int j = i + 1; j < nums.length; j++) { 7 | for(int k = j + 1; k < nums.length; k++) { 8 | int n = nums[i] + nums[j] + nums[k]; 9 | boolean b = true; 10 | for(int h = 2; h <= Math.sqrt(n); h++) { 11 | if(n % h == 0) { 12 | b = false; 13 | break; 14 | } 15 | } 16 | if(b == true) 17 | answer++; 18 | } 19 | } 20 | } 21 | return answer; 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.소수_만들기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(nums) { 2 | let answer = 0; 3 | const isPrime = num => { 4 | for (let i = 2; i <= Math.sqrt(num); i++) 5 | if (num % i === 0) return false; 6 | return num > 1; 7 | } 8 | 9 | for (let i = 0; i < nums.length - 2; i++) { 10 | let temp = 0; 11 | for (let j = i + 1; j < nums.length - 1; j++) { 12 | for (let k = j + 1; k < nums.length; k++) { 13 | temp = nums[i] + nums[j] + nums[k]; 14 | if (isPrime(temp)) answer++; 15 | } 16 | } 17 | } 18 | 19 | return answer; 20 | } 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.소수_찾기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | let compositionNum = new Set(); 3 | const sqrtNum = Math.sqrt(n); 4 | 5 | for(let i=2; iel==1).length 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.소수_찾기/Leemainsw.ts: -------------------------------------------------------------------------------- 1 | /** 2 | * @param num: number 숫자 3 | * @returns number 4 | */ 5 | function solution(num: number): number { 6 | // 1 ~ num 길이 만큼의 배열을 생성해서 1을 채운다. 7 | const arr: Array = new Array(num).fill(1); 8 | 9 | // 1은 소수가 아니기 때문에 0으로 변경 10 | arr[0] = 0; 11 | 12 | // 2부터 자신의 제곱근을 돌면서 자신의 배수를 0으로 바꾼다. 13 | for(let i: number = 2; i*i <= num; i++){ //2,3,4,5, 14 | for(let j:number = i*i; j<=num; j+=i){ // (2,4,8..), (3,6,9..) 15 | //j-1인 경우는 인덱스 때문에 ^^ 16 | arr[j-1] = 0; 17 | } 18 | } 19 | 20 | return arr.filter((el)=>el==1).length 21 | } 22 | 23 | const result1 = solution(10); 24 | console.log('result1', result1); // "result1", 4 25 | 26 | const result2 = solution(5); 27 | console.log('result2', result2); // "result2", 3 28 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.소수_찾기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n) { 3 | int answer = 0; 4 | 5 | for(int i = 2; i <= n; i++) { 6 | boolean flag = true; 7 | for(int j = 2; j <= Math.sqrt(i) && flag; j++) 8 | flag = i % j == 0 ? false : true; 9 | answer += flag? 1 : 0; 10 | } 11 | 12 | return answer; 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.소수_찾기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | answer = 0 3 | 4 | for i in range(2, n + 1) : 5 | bln = True 6 | for j in range(2, int(i ** 0.5) + 1) : 7 | if i % j == 0: 8 | bln = False 9 | break 10 | if bln : 11 | answer = answer + 1 12 | 13 | return answer 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.소수_찾기/pppeum62.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n) { 3 | int answer = 0; 4 | int cnt = 0; 5 | 6 | for(int i = 2; i <= n; i++) { 7 | cnt = 0; 8 | 9 | for(int j = 1; j <= Math.sqrt(i); j++) { 10 | 11 | if(i % j == 0) cnt++; 12 | 13 | if(cnt >= 2) break; 14 | } 15 | 16 | if ( cnt < 2) answer++; 17 | } 18 | 19 | return answer; 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.수박수박수박수박수박수/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | char* solution(int n) { 6 | char* answer = (char*)malloc(sizeof(char)*(n*3)+1); 7 | memset(answer, '\0', (n * 3) + 1); 8 | char* water = "수"; 9 | char* melon = "박"; 10 | 11 | for (int i = 0; i < n; i++) { 12 | if (i % 2 == 0) { 13 | strcat(answer, water); 14 | } 15 | else { 16 | strcat(answer, melon); 17 | } 18 | } 19 | 20 | return answer; 21 | } 22 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.수박수박수박수박수박수/JiaLee0707.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(int n) { 3 | String answer = ""; 4 | for(int i=0; i -1) { 9 | sbf.replace(idx, idx + engNum[i].length(), String.valueOf(i)); 10 | idx = sbf.indexOf(engNum[i]); 11 | } 12 | } 13 | 14 | return Integer.parseInt(sbf.toString()); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.숫자_문자열과_영단어/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | //처음에는 replace에 정규식으로 하나하나씩 주다가 다른 분 코드 보고 수정하였다 3 | var answer = s; 4 | var words = ['zero','one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine']; 5 | 6 | for(let i = 0; i < words.length; i++) { 7 | let arr = answer.split(words[i]); 8 | console.log(arr); 9 | answer = arr.join(i); 10 | } 11 | 12 | return Number(answer); 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.숫자_문자열과_영단어/pppeum62.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(String s) { 3 | final String[] numbers = { "zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" }; 4 | StringBuilder sb = new StringBuilder(s); 5 | 6 | for (int i = 0; i < numbers.length; i++) { 7 | sb = new StringBuilder(sb.toString().replace(numbers[i], String.valueOf(i))); 8 | } 9 | 10 | return Integer.parseInt(sb.toString()); 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.숫자_문자열과_영단어/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | var numbers = [ "zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" ]; 3 | var n = -1; 4 | 5 | for (var i = 0; i < numbers.length;) { 6 | n = s.indexOf(numbers[i]); 7 | 8 | if (n != -1) { 9 | s = s.substr(0, n) + i + s.substr(n + numbers[i].length); 10 | i--; 11 | } else i++; 12 | } 13 | 14 | return parseInt(s); 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.시저_암호/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(s, n) { 2 | return s.split('').map((r) => { 3 | if (r === ' ') return r; 4 | 5 | let upperCaseASCII = (r.toUpperCase()).charCodeAt(); 6 | if (upperCaseASCII + n > 'Z'.charCodeAt()) r = r.charCodeAt() + n - 26; 7 | else r = r.charCodeAt() + n; 8 | 9 | return String.fromCharCode(r); 10 | }).join(''); 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.시저_암호/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(String s, int n) { 3 | String answer = ""; 4 | 5 | char str[] = s.toCharArray(); 6 | 7 | for(char ch : str) { 8 | for(int j = 0; j < n; j++) { 9 | ch = (char)((ch == ' ')? ch : 10 | (ch == 'z' || ch == 'Z')? ch - 25 : ch + 1); 11 | }//for 12 | answer += Character.toString(ch); 13 | }//foreach 14 | 15 | return answer; 16 | 17 | }//main 18 | }//class 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.시저_암호/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(s, n): 2 | answer = '' 3 | 4 | for ch in s : 5 | i = ord(ch) 6 | if(ch == ' ') : 7 | answer += " " 8 | continue 9 | for j in range(0, n) : 10 | if(i == 122 or i == 90) : 11 | i -= 25 12 | continue 13 | i += 1 14 | answer += str(chr(i)) 15 | 16 | return answer 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.시저_암호/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(s, n) { 2 | var answer = ""; 3 | for(let i=0; i 90) ? (s.charCodeAt(i)+n-97)%26+97 : (s.charCodeAt(i)+n-65)%26+65) 8 | } 9 | return answer; 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.시저_암호/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(s, n) { 2 | let answer = s.split(''); 3 | 4 | for (let i in answer) { 5 | if (answer[i] === ' ') continue; 6 | 7 | answer[i] = answer[i].charCodeAt(); 8 | 9 | if (answer[i] > 'Z'.charCodeAt()) { 10 | answer[i] += answer[i] + n > 'z'.charCodeAt() ? n - 26 : n; 11 | } else { 12 | answer[i] += answer[i] + n > 'Z'.charCodeAt() ? n - 26 : n; 13 | } 14 | 15 | answer[i] = String.fromCharCode(answer[i]); 16 | } 17 | 18 | return answer.join(''); 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.신규_아이디_추천/SSSOy.py: -------------------------------------------------------------------------------- 1 | import re 2 | 3 | def solution(new_id): 4 | 5 | answer = new_id.lower() 6 | answer = "".join(re.findall(r"[\w\-\.]" , answer)) 7 | answer = re.sub("\.\.+", ".", answer) 8 | answer = re.sub("^\.", "", answer) 9 | answer = re.sub("\.$", "", answer) 10 | if answer == "" : 11 | answer = "a" 12 | if len(answer) >= 16 : 13 | answer = answer[:15] 14 | answer = re.sub("\.$", "", answer) 15 | if len(answer) <= 2 : 16 | length = len(answer) 17 | answer = answer + "".join([answer[length - 1] for i in range(0, 3 - length)]) 18 | 19 | return answer 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.신규_아이디_추천/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(new_id) { 2 | const answer = new_id.toLowerCase() 3 | .replace(/[^a-z0-9-_.]/g, '') 4 | .replace(/[.]{1,}/g, '.') 5 | .replace(/^[.]+/, '') 6 | .replace(/[.]+$/, '') 7 | .replace(/^$/, 'a') 8 | .substring(0, 15) 9 | .replace(/[.]+$/, ''); 10 | 11 | return answer.padEnd(3, answer[answer.length-1]); 12 | } 13 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.신규_아이디_추천/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(new_id) { 2 | var answer = ''; 3 | 4 | answer = new_id.toLowerCase() 5 | .replace(new RegExp(/[^a-z0-9-_\.]/g), "") 6 | .replace(/\.{2,}/g, ".") 7 | .replace(new RegExp(/^\./g), "") 8 | .replace(new RegExp(/\.$/g), ""); 9 | 10 | answer = (!answer) ? "a" : answer; 11 | answer = (answer.length >= 16) ? answer.slice(0, 15) : answer; 12 | answer = answer.replace(new RegExp(/\.$/g), ""); 13 | 14 | while (answer.length <= 2) { 15 | answer += answer.slice(answer.length - 1); 16 | } 17 | 18 | return answer; 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.실패율/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(N, stages): 2 | answer = [] 3 | dic = {0:1.1} 4 | 5 | for i in range(1, N + 1) : 6 | cnt_success = 0 7 | cnt_fail = 0 8 | for j in stages : 9 | if j >= i : 10 | cnt_success = cnt_success + 1 11 | if j == i : 12 | cnt_fail = cnt_fail + 1 13 | if cnt_success == 0 : 14 | dic[i] = 0 15 | else : 16 | dic[i] = cnt_fail / cnt_success 17 | 18 | del dic[0] 19 | dic = sorted(dic.items(), key=(lambda x:x[1]), reverse=True) 20 | 21 | for item in dic : 22 | answer.append(item[0]) 23 | 24 | return answer 25 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.아픈_동물_찾기/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME 2 | FROM ANIMAL_INS 3 | WHERE INTAKE_CONDITION LIKE 'Sick'; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.아픈_동물_찾기/suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name FROM animal_ins WHERE intake_condition = "sick"; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.아픈_동물_찾기/yoojinhee03.sql: -------------------------------------------------------------------------------- 1 | -- 코드를 입력하세요 2 | SELECT ANIMAL_ID, NAME FROM ANIMAL_INS WHERE INTAKE_CONDITION = 'Sick'; -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_개수와_덧셈/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(left, right) { 2 | let result = 0; 3 | [...Array(right-left+1).keys()].map((value) => { 4 | let count = 0; 5 | const loopLenght = value + left; 6 | for (let i = 1; i<=loopLenght; i++) { 7 | if (loopLenght % i === 0) count += 1; 8 | } 9 | 10 | if (count % 2 === 0) result += loopLenght; 11 | else result -= loopLenght; 12 | }); 13 | 14 | return result; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_개수와_덧셈/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int left, int right) { 3 | int answer = 0; 4 | 5 | for(int i = left; i <= right; i++) { 6 | int cnt = CntDivisor(i); 7 | answer += cnt % 2 == 0? i : i * (-1); 8 | } 9 | 10 | return answer; 11 | } 12 | 13 | public int CntDivisor(int n) { 14 | int cnt = 1; 15 | 16 | for(int i = 2; i <= n; i++) { 17 | if(n % i == 0) 18 | cnt++; 19 | } 20 | 21 | return cnt; 22 | } 23 | } 24 | 25 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_개수와_덧셈/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(left, right) { 2 | var answer = 0; 3 | var cnt = 0; 4 | 5 | for (var i = left; i <= right; i++) { 6 | cnt = 0; 7 | 8 | for (var j = 0; j <= i; j++) 9 | if (i % j === 0) cnt++; 10 | 11 | answer += cnt % 2 === 0 ? i : i * -1; 12 | } 13 | 14 | return answer; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int solution(int n) { 6 | int answer = 0; 7 | 8 | for(int i=n; i>0; i--) { 9 | if(n%i==0) { 10 | answer += i; 11 | } 12 | } 13 | 14 | return answer; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/JiaLee0707.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n) { 3 | int answer = 0; 4 | for(int i=n; i>0; i--) { 5 | answer += (n%i==0 ? i : 0); 6 | } 7 | return answer; 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n) { 3 | int answer = 0; 4 | 5 | for(int i = 1; i <= n; i++) { 6 | answer += n % i == 0 ? i : 0; 7 | } 8 | 9 | return answer; 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | list = [x for x in range(1, n + 1) if n % x == 0] 3 | return sum(list) 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/areum.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | let answer = 0; 3 | for(let i=1; i<=n; i++){ 4 | if(n%i==0) answer += i; 5 | } 6 | return answer; 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/heena01.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | answer = sum([i for i in range(1, n + 1) if n % i == 0]) 3 | return answer 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/pppeum62.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n) { 3 | int answer = 0; 4 | 5 | for(int i = 1; i <= n; i++) { 6 | if(n % i == 0) { 7 | answer += i; 8 | } 9 | } 10 | 11 | return answer; 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/wander0220.js: -------------------------------------------------------------------------------- 1 | function wander0220(n) { 2 | var sum = 0; 3 | 4 | for(var i = 1 ; i <= n ; i++){ 5 | if(n%i==0) sum+=i; 6 | } 7 | 8 | return sum; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.약수의_합/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class yoojinhee03 { 4 | 5 | public static void main(String[] args) { 6 | System.out.println(solution(6)); 7 | 8 | } 9 | public static int solution(int n) { 10 | int answer=n; 11 | for(int i=2; i<=n/2; i++) { 12 | if(n%i==0) { 13 | answer+=i; 14 | } 15 | } 16 | return answer; 17 | } 18 | } 19 | 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.어린_동물_찾기/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name 2 | FROM animal_ins 3 | WHERE intake_condition != 'Aged' 4 | ORDER BY 1; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.없는_숫자_더하기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | const allSum = 45; 3 | const numSum = numbers.reduce((value1, value2) => value1 + value2); 4 | 5 | return allSum - numSum; 6 | } 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.없는_숫자_더하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int[] numbers) { 3 | int answer = 0; 4 | String strNumbers = ""; 5 | for(int i : numbers) 6 | strNumbers += Integer.toString(i); 7 | 8 | for(int i = 0; i < 10; i++) { 9 | answer += strNumbers.contains(Integer.toString(i)) == false? i : 0; 10 | } 11 | 12 | return answer; 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.없는_숫자_더하기/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | var answer = 0; 3 | for(let n=1; n<10; n++){ 4 | if(!numbers.includes(n)){ 5 | answer += n; 6 | } 7 | } 8 | return answer; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.없는_숫자_더하기/jeyin720.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | return 45 - numbers.reduce( (prev, curr) => prev + curr ); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.없는_숫자_더하기/pppeum62.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int[] numbers) { 3 | int answer = 0; 4 | String none = "123456789"; 5 | 6 | for (int i : numbers) { 7 | none = none.replace(i+"", ""); 8 | } 9 | 10 | for (int i = 0; i < none.length(); i++) { 11 | answer += Integer.parseInt(none.charAt(i)+""); 12 | } 13 | 14 | return answer; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.없는_숫자_더하기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | return 45 - numbers.reduce((a, b) => (a + b)); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.없는_숫자_더하기/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | return 45 - numbers.reduce((a, b) => a + b); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.여러_기준으로_정렬하기/Moon-Hyekyung.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name, datetime FROM animal_ins ORDER BY name, datetime desc; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.여러_기준으로_정렬하기/Suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name, datetime FROM ANIMAL_INS 2 | ORDER BY name asc, datetime desc 3 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.역순_정렬하기/yoojinhee03.sql: -------------------------------------------------------------------------------- 1 | SELECT NAME, DATETIME FROM ANIMAL_INS ORDER BY ANIMAL_ID DESC; -------------------------------------------------------------------------------- /programmers/난이도별/level01.예산/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(d, budget) { 2 | var answer = 0; 3 | d.sort((value1, value2) => value1 - value2); 4 | 5 | for(const value of d) { 6 | if(value > budget) break; 7 | budget -= value; 8 | answer++; 9 | } 10 | return answer; 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.예산/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public int solution(int[] d, int budget) { 5 | int answer = 0; 6 | 7 | Arrays.sort(d); 8 | for(int i = 0; i < d.length; i++) { 9 | if(budget - d[i] >= 0) { 10 | answer++; 11 | budget -= d[i]; 12 | } 13 | else 14 | break; 15 | } 16 | 17 | return answer; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.예산/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(d, budget): 2 | d.sort() 3 | n = 0 4 | 5 | for i in range(0, len(d)) : 6 | if(n + d[i] > budget) : 7 | return i 8 | n = n + d[i] 9 | 10 | return len(d) 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.예산/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(d, budget) { 2 | var answer = 0; 3 | let num = d.sort((a, b) => a - b); 4 | 5 | for(let i=0; i= 0){ 7 | budget -= num[i] 8 | answer++; 9 | } 10 | else{ 11 | break; 12 | } 13 | } 14 | 15 | return answer; 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.예산/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(d, budget) { 2 | var answer = 0; 3 | d = d.sort((a, b) => a - b); 4 | 5 | for (var i in d) { 6 | budget -= d[i]; 7 | if (budget >= 0) answer++; 8 | else break; 9 | } 10 | 11 | return answer; 12 | } 13 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.예산/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | class Solution { 3 | public int solution(int[] d, int budget) { 4 | int answer = 0; 5 | int sum=0; 6 | Arrays.sort(d); 7 | 8 | for(int number:d) { 9 | sum+=number; 10 | if(sum>budget)break; 11 | answer++; 12 | } 13 | return answer; 14 | } 15 | } -------------------------------------------------------------------------------- /programmers/난이도별/level01.완주하지_못한_선수/JiaLee0707.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public String solution(String[] participant, String[] completion) { 5 | Arrays.sort(participant); 6 | Arrays.sort(completion); 7 | String answer = participant[participant.length-1]; 8 | 9 | for(int i=0; i 100000) return; 4 | participant.sort(); 5 | completion.sort(); 6 | return answer = participant.find((p, i) => p != completion[i]); 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.완주하지_못한_선수/yoojinhee03.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Mirim-Study/Algorithm/8281f02f504b8c3d23a269d84b3f2acb7ce0ceb5/programmers/난이도별/level01.완주하지_못한_선수/yoojinhee03.java -------------------------------------------------------------------------------- /programmers/난이도별/level01.음양_더하기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(absolutes, signs) { 2 | var answer = 0; 3 | 4 | for (const [index, value] of absolutes.entries()) { 5 | answer += signs[index] ? value : -value; 6 | } 7 | return answer; 8 | } 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.음양_더하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(absolutes, signs) { 2 | let sum = 0; 3 | for(const idx in absolutes) { 4 | sum += signs[idx] ? absolutes[idx] : -(absolutes[idx]); 5 | } 6 | return sum; 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.음양_더하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int[] absolutes, boolean[] signs) { 3 | int answer = 0; 4 | 5 | for(int i = 0; i < absolutes.length; i++) 6 | answer += signs[i] == true? absolutes[i] : absolutes[i] * (-1); 7 | 8 | return answer; 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.음양_더하기/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(absolutes, signs) { 2 | var answer = 0; 3 | for(let i=0; i (sign ? absolutes[index] : absolutes[index] * -1)).reduce((a, b) => a + b) 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이름이_없는_동물의_아이디/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID 2 | FROM ANIMAL_INS 3 | WHERE NAME IS NULL; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이름이_있는_동물의_아이디/Moon-HyeKyung.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id FROM animal_ins WHERE name IS NOT NULL; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이름이_있는_동물의_아이디/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID 2 | FROM ANIMAL_INS 3 | WHERE NAME IS NOT NULL; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이상한_문자_만들기/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | char* solution(const char* s) { 2 | int i = 0, EvenOrOdd = 0; 3 | char* answer = (char*)malloc(sizeof(char) * strlen(s) + 1); 4 | strcpy(answer, s); 5 | 6 | while (answer[i] != '\0') { 7 | if (answer[i] == ' ') { 8 | EvenOrOdd = -1; 9 | } 10 | else if (EvenOrOdd % 2 == 0) { 11 | if (answer[i] >= 'a' && answer[i] <= 'z') { 12 | answer[i] = answer[i] - 32; 13 | } 14 | } 15 | else if (EvenOrOdd % 2 == 1){ 16 | if (answer[i] >= 'A' && answer[i] <= 'Z') { 17 | answer[i] = answer[i] + 32; 18 | } 19 | } 20 | 21 | i++; 22 | EvenOrOdd++; 23 | 24 | } 25 | return answer; 26 | } 27 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이상한_문자_만들기/Leemainsw.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | // 영어만 두 문자씩 가져오는 정규식 3 | // 여기서 \w는 [A-Za-z0-9_]과 동일하다. 4 | const regExp = /(\w)(\w)/g; 5 | 6 | // 모든 문자를 대문자로 변환한다. 7 | return s.toUpperCase().replace(regExp, (a)=> { 8 | // a = (TR),(HE),(LL) ... 9 | // 0번째는 항상 짝수, 1번째는 항상 홀수 10 | // a로 들어오는 문자들은 항상 대문자임으로 홀수만 소문자로 변환한다. 11 | return a[0] + a[1].toLowerCase(); 12 | }) 13 | 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이상한_문자_만들기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(String s) { 3 | StringBuilder answer = new StringBuilder(s.toUpperCase()); 4 | 5 | boolean b = true; 6 | String s2 = s.toLowerCase(); 7 | 8 | for(int i = 0; i < answer.length(); i++) { 9 | if(answer.charAt(i) == ' ') { 10 | b = true; 11 | continue; 12 | } 13 | if(b) 14 | b = false; 15 | else { 16 | answer.setCharAt(i, s2.charAt(i)); 17 | b = true; 18 | } 19 | } 20 | 21 | return answer.toString(); 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이상한_문자_만들기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(s): 2 | s = s.upper() 3 | answer = '' 4 | string = '' 5 | var = [] 6 | 7 | for i in list(s) : 8 | string = string + i 9 | var = [ch if idx % 2 == 0 else ch.lower() for idx, ch in enumerate(string)] 10 | if(i == " ") : 11 | answer = answer + ''.join(var) 12 | string = '' 13 | continue 14 | 15 | if s[-1] != ' ' : 16 | answer = answer + ''.join(var) 17 | 18 | return answer 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.이상한_문자_만들기/areum.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | var answer = []; 3 | var str = s.toLowerCase().split(''); 4 | let count = 0; 5 | 6 | for(let i=0; i 2 | #include 3 | #include 4 | 5 | int solution(int n) { 6 | int answer = 0; 7 | 8 | do { 9 | answer += n % 10; 10 | n /= 10; 11 | } while(n > 0); 12 | 13 | return answer; 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자릿수_더하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | const reducer = (a,b) => Number(a) + Number(b); 3 | return Number(n.toString(10).split('').reduce(reducer)) 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자릿수_더하기/SSSOy.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int solution(int n) { 4 | int answer = 0; 5 | 6 | while(n > 0) { 7 | answer += n % 10; 8 | n /= 10; 9 | } 10 | 11 | return answer; 12 | } 13 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자릿수_더하기/areum.js: -------------------------------------------------------------------------------- 1 | function solution(n) 2 | { 3 | var answer = 0; 4 | n = (n+'').split(''); 5 | for(let i =0; i0) { 8 | answer+=n%10; 9 | n/=10; 10 | } 11 | return answer; 12 | } 13 | } -------------------------------------------------------------------------------- /programmers/난이도별/level01.자연수_뒤집어_배열로_만들기/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int* solution(long long n) { 6 | int* answer = (int*)malloc(sizeof(int)*12); 7 | int i = 0; 8 | while (n > 0) { 9 | answer[i] = n % 10; 10 | n /= 10; 11 | i++; 12 | } 13 | 14 | return answer; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자연수_뒤집어_배열로_만들기/Leemainsw.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | const answer = n 3 | .toString() 4 | .split('') 5 | .map((num)=> Number(num)) 6 | .reverse(); 7 | 8 | return answer; 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자연수_뒤집어_배열로_만들기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | return (n+"").split("").map((a) => Number.parseInt(a)).reverse(); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자연수_뒤집어_배열로_만들기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[] solution(long n) { 3 | String s = Long.toString(n); 4 | int len = s.length(); 5 | int[] answer = new int[len]; 6 | 7 | for(int i = 0; i < len; i++) 8 | answer[i] = s.charAt(len - 1 - i) - 48; 9 | 10 | return answer; 11 | } 12 | } 13 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자연수_뒤집어_배열로_만들기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | answer = list(str(n)) 3 | answer.reverse() 4 | answer = [int(i) for i in answer] 5 | return answer 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.자연수_뒤집어_배열로_만들기/areum.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | var answer = []; 3 | n += ""; 4 | n = n.split('').reverse(); 5 | for(let i=0; i parseInt(str)); 5 | } 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_내림차순으로_배치하기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | return parseInt(n.toString().split('').sort().reverse().join('')); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_내림차순으로_배치하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | return Number(n.toString(10).split('').sort().reverse().reduce((a,b)=>a+b+"")) 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_내림차순으로_배치하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public long solution(long n) { 5 | String answer = ""; 6 | 7 | String s = Long.toString(n); 8 | String[] arr = s.split(""); 9 | Arrays.sort(arr, Collections.reverseOrder()); 10 | 11 | for(String a : arr) 12 | answer += a; 13 | 14 | return Long.parseLong(answer); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_내림차순으로_배치하기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | answer = 0 3 | array = [int(x) for x in list(str(n))] 4 | array.sort(reverse = True) 5 | return int("".join([str(x) for x in array])) 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_내림차순으로_배치하기/areum.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | var answer = 0; 3 | n += ""; 4 | var number = n.split(''); 5 | answer = Number(number.sort().reverse().join('')); 6 | return answer; 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_내림차순으로_배치하기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | n += ''; 3 | 4 | return parseInt(n.split('').sort().reverse().join('')); 5 | } 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_내림차순으로_배치하기/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | return Number(String(n).split("").map(e => e).sort((a, b) => b - a).join("")); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_제곱근_판별/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | long long solution(long long n) { 6 | long long answer = 0; 7 | 8 | if (sqrt(n) == (int)sqrt(n)) { 9 | // answer = (sqrt(n)+1) * (sqrt(n)+1); 10 | answer = pow(sqrt(n) + 1, 2); 11 | } 12 | else answer = -1; 13 | 14 | return answer; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_제곱근_판별/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | const root = Math.sqrt(n); 3 | return root%1===0 ? Math.pow(root+1,2) : -1 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_제곱근_판별/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public long solution(long n) { 3 | long answer = (long)Math.sqrt(n); 4 | 5 | answer = answer * answer != n? -1 : (answer + 1) * (answer + 1); 6 | 7 | return answer; 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_제곱근_판별/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | answer = -1 3 | sqrt = n ** 0.5 4 | if sqrt.is_integer() : 5 | sqrt = sqrt + 1 6 | answer = sqrt ** 2 7 | return answer 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_제곱근_판별/areum.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | var num = Math.sqrt(n); 3 | 4 | if(num !== parseInt(num)){ 5 | return -1; 6 | } 7 | else { 8 | return Math.pow(num+1,2); 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_제곱근_판별/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | var num = parseInt(Math.sqrt(n)); 3 | 4 | return num ** 2 === n ? (num + 1) ** 2 : -1; 5 | } 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.정수_제곱근_판별/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class yoojinhee03 { 4 | 5 | public static void main(String[] args) { 6 | 7 | System.out.println(solution(3)); 8 | 9 | } 10 | public static long solution(long n) { 11 | long answer = 0; 12 | 13 | if(Math.sqrt(n)==(int)Math.sqrt(n)) { 14 | return (long) Math.pow(Math.sqrt(n)+1, 2); 15 | }else { 16 | return -1; 17 | } 18 | } 19 | } -------------------------------------------------------------------------------- /programmers/난이도별/level01.제일_작은_수_제거하기/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(arr) { 2 | // 1 3 | if(arr.length < 2) return [-1]; 4 | 5 | arr.splice(arr.indexOf(Math.min(...arr)), 1); 6 | return arr; 7 | 8 | // 2 9 | // if (arr.length < 2) return [-1]; 10 | 11 | // let result = 0; 12 | // const arrLength = arr.length; 13 | // for (let i=1; i arr[i]) result = i; 15 | // } 16 | 17 | // arr.splice(result, 1); 18 | 19 | // return arr; 20 | } 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.제일_작은_수_제거하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(arr) { 2 | return arr.length === 1 ? [-1] : arr.filter(value => value !== Math.min(...arr)); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.제일_작은_수_제거하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public int[] solution(int[] arr) { 5 | 6 | int min = arr[0]; 7 | List list = new ArrayList(); 8 | for (int i : arr) { 9 | list.add(i); 10 | if(min > i) 11 | min = i; 12 | } 13 | 14 | list.remove((Integer)min); 15 | 16 | int[] answer = new int[list.size() > 0? list.size() : 1]; 17 | int size = 0; 18 | 19 | for(int temp : list) 20 | answer[size++] = temp; 21 | if(size == 0) 22 | answer[0] = -1; 23 | 24 | return answer; 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.제일_작은_수_제거하기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(arr): 2 | if (len(arr) == 1) : 3 | return [-1] 4 | 5 | min_num = min(arr) 6 | 7 | for i in arr : 8 | if (i == min_num) : 9 | arr.remove(i) 10 | 11 | return arr 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.제일_작은_수_제거하기/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(arr) { 2 | let idx = 0; 3 | let min = arr[0]; 4 | 5 | if(arr.length === 1) { 6 | return [-1]; 7 | } 8 | 9 | for(let i = 1; i < arr.length; i++) { 10 | min = Math.min(min, arr[i]); 11 | idx = arr.indexOf(min); 12 | } 13 | 14 | arr.splice(idx, 1); 15 | 16 | return arr; 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.제일_작은_수_제거하기/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[] solution(int[] arr) { 3 | int[] answer = new int[arr.length>1?arr.length-1:1]; 4 | int min=arr[0]; 5 | int idx=0; 6 | if(answer.length==1) { 7 | answer[0]=-1; 8 | return answer; 9 | } 10 | 11 | for(int i=1; iarr[i])min=arr[i]; 13 | } 14 | for(int i=0; i 2 | 3 | int main(void) { 4 | int a; 5 | int b; 6 | scanf("%d %d", &a, &b); 7 | 8 | for(int i=0; i { 3 | const n = data.split(" "); 4 | const a = Number(n[0]), b = Number(n[1]); 5 | let str = ""; 6 | 7 | for(let i=0; i { 3 | const n = data.split(" "); 4 | const a = Number(n[0]), b = Number(n[1]); 5 | let line = "*"; 6 | 7 | for(let i = 1; i < a; i++) { 8 | line += "*"; 9 | } 10 | 11 | for(let j = 0; j < b; j++) { 12 | console.log(line); 13 | } 14 | }); 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.짝수와_홀수/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | char* solution(int num) { 6 | // if(num%2==0) { 7 | // return "Even"; 8 | // } else { 9 | // return "Odd"; 10 | // } 11 | 12 | return num % 2 == 0 ? "Even" : "Odd"; 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.짝수와_홀수/JiaLee0707.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(int num) { 3 | String answer = (num%2==0 ? "Even" : "Odd"); 4 | return answer; 5 | } 6 | } 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.짝수와_홀수/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(num) { 2 | return num % 2 ? 'Odd' : 'Even'; 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.짝수와_홀수/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(int num) { 3 | return num % 2 == 0? "Even" : "Odd"; 4 | } 5 | } 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.짝수와_홀수/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(num): 2 | return 'Even' if num % 2 == 0 else 'Odd' 3 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.짝수와_홀수/areumsheep.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(int num) { 3 | return num%2==0 ? "Even" : "Odd"; 4 | } 5 | } 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.짝수와_홀수/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(num) { 2 | return num % 2 ? "Odd" : "Even"; 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.체육복/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(n, lost, reserve) { 2 | const lost_filter = lost.sort((a, b) => a - b).filter((value) => !reserve.includes(value)); 3 | const reserve_filter = reserve.sort((a, b) => a - b).filter((value) => !lost.includes(value)); 4 | 5 | for(const reservePerson of reserve_filter) { 6 | for(const lostPerson of lost_filter) { 7 | if(Math.abs(reservePerson - lostPerson) === 1) { 8 | lost_filter.shift(); 9 | break; 10 | } 11 | } 12 | } 13 | 14 | return n - lost_filter.length; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.체육복/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n, lost, reserve): 2 | students = [1 for x in range(n + 2)] 3 | 4 | for i in lost : 5 | students[i] -= 1 6 | for i in reserve : 7 | students[i] += 1 8 | 9 | for i in range(n) : 10 | if(i == 0 or i == n + 1) : 11 | continue 12 | if students[i] == 0 : 13 | if students[i - 1] == 2 : 14 | students[i - 1] = 1 15 | students[i] = 1 16 | elif students[i + 1] == 2 : 17 | students[i + 1] = 1 18 | students[i] = 1 19 | 20 | return sum(1 for i in students if i > 0) - 2 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.최대공약수와_최소공배수/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(n, m) { 2 | let answer = []; 3 | let min = n > m ? m : n; 4 | let max = n > m ? n : m; 5 | 6 | // 1 7 | // for (let i=1; i<=min; i++) { 8 | // if (n%i === 0 && m%i === 0) { 9 | // answer[0] = i; 10 | // answer[1] = i * (n/i) * (m/i) 11 | // } 12 | // } 13 | 14 | // 2 15 | while (min != 0) { 16 | answer[0] = max % min; 17 | max = min; 18 | min = answer[0]; 19 | } 20 | answer[0] = max; 21 | 22 | answer[1] = n*m/answer[0]; 23 | 24 | return answer; 25 | } 26 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.최대공약수와_최소공배수/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[] solution(int n, int m) { 3 | int[] answer = new int[2]; 4 | 5 | boolean b = true; 6 | int min = n < m ? n : m; 7 | 8 | for(int i = 1; i <= min; i++) { 9 | if(n % i == 0 && m % i == 0) 10 | answer[0] = i; 11 | } 12 | 13 | for(int i = 1; b; i++) { 14 | if(i % n == 0 && i % m == 0 && b) { 15 | answer[1] = i; 16 | b = false; 17 | } 18 | } 19 | 20 | return answer; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.최대공약수와_최소공배수/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n, m): 2 | answer = [0, 0] 3 | min = n if n < m else m 4 | 5 | for i in range(1, min + 1) : 6 | if n % i == 0 and m % i == 0 : 7 | answer[0] = i; 8 | 9 | i = 1 10 | while True : 11 | if i % n == 0 and i % m == 0 : 12 | answer[1] = i 13 | break; 14 | i = i + 1 15 | 16 | return answer 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.최대공약수와_최소공배수/areum.js: -------------------------------------------------------------------------------- 1 | function solution(n, m) { 2 | var answer = []; 3 | var temp = 0; 4 | 5 | // n자리에 무조건 작은 수가 오게하기 6 | if(n>m){ 7 | temp = m; 8 | m = n; 9 | n = temp; 10 | } 11 | 12 | // 최대공약수 13 | for(var i=n; i>=1; i--){ 14 | if(n%i===0 && m%i===0){ 15 | answer[0] = i; 16 | break; 17 | } 18 | } 19 | 20 | // 짠 코드인데 다른 사람의 코드가 더 효율적임 21 | // for(let i=1; i<=m; i++){ 22 | // if(n%i==0 && m%i==0){ 23 | // answer[0]=i; 24 | // } 25 | // } 26 | 27 | // 최소공배수 28 | answer[1] = m*n/answer[0]; 29 | 30 | return answer; 31 | } 32 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.최소직사각형/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(sizes) { 2 | var answer = 0; 3 | let max = [0,0]; 4 | 5 | sizes = sizes.map((size) => size[1] > size[0] ? [size[1], size[0]] : size); 6 | 7 | for (const size of sizes) { 8 | if (size[0] > max[0]) max[0] = size[0]; 9 | if (size[1] > max[1]) max[1] = size[1]; 10 | } 11 | 12 | answer = max[0] * max[1]; 13 | 14 | return answer; 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.최소직사각형/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int[][] sizes) { 3 | int width = 0; 4 | int height = 0; 5 | 6 | for(int i = 0; i < sizes.length; i++) { 7 | int max = sizes[i][0] > sizes[i][1]? sizes[i][0] : sizes[i][1]; 8 | int min = sizes[i][0] < sizes[i][1]? sizes[i][0] : sizes[i][1]; 9 | 10 | width = width < max ? max : width; 11 | height = height < min ? min : height; 12 | } 13 | 14 | return width * height; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.최솟값_구하기/yoojinhee03.sql: -------------------------------------------------------------------------------- 1 | -- 코드를 입력하세요 2 | SELECT min(datetime) from ANIMAL_INS -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int solution(int num) { 6 | int answer = 0; 7 | long long number = num; 8 | 9 | for (answer = 0; answer < 500; answer++) { 10 | if (number == 1) return answer; 11 | else if (number % 2 == 0) number /= 2; 12 | else number = number * 3 + 1; 13 | } 14 | 15 | return -1; 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/JiaLee0707.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int num) { 3 | long answer = num; 4 | for(int i=0; i<500; i++) { 5 | if(answer == 1) return i; 6 | answer = answer%2==0 ? answer/2 : answer*3+1; 7 | } 8 | 9 | return -1; 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(num) { 2 | let count = 0; 3 | while(num>1) { 4 | if(count >= 500) return -1; 5 | if(num%2 === 0){ 6 | num/=2; 7 | } else { 8 | num = num*3+1; 9 | } 10 | count++; 11 | } 12 | return count; 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int num) { 3 | long n = num; 4 | 5 | for(int i = 0; i < 500; i++) { 6 | if(n == 1) 7 | return i; 8 | 9 | if(n % 2 == 0) 10 | n /= 2; 11 | else 12 | n = (n * 3) + 1; 13 | } 14 | return -1; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(num): 2 | answer = 0 3 | 4 | while num != 1 and answer <= 500: 5 | num = num / 2 if num % 2 == 0 else num * 3 + 1 6 | answer = answer + 1 7 | 8 | return answer if answer <= 500 else -1 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/Suhyeon.js: -------------------------------------------------------------------------------- 1 | function solution(num) { 2 | var answer = 0; 3 | 4 | if(num==1){ 5 | return 0; 6 | } 7 | 8 | do{ 9 | if(num%2==0) 10 | { 11 | num=num/2; 12 | answer++; 13 | } 14 | else if(num%2!=0) 15 | { 16 | num=num*3+1; 17 | answer++; 18 | } 19 | }while(num!=1&&answer!=500) 20 | 21 | if(answer==500)answer=-1; 22 | 23 | return answer; 24 | } 25 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(num) { 2 | var i = 1; 3 | if(num == 1) 4 | return 0; 5 | 6 | while(i <= 500){ 7 | if(num %2 == 0) 8 | num /= 2; 9 | else if(num %2 == 1) 10 | num = num * 3 + 1; 11 | if(num == 1){ 12 | break; 13 | } 14 | 15 | i ++; 16 | } 17 | if(i > 500) 18 | return -1; 19 | 20 | return i; 21 | } 22 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(num) { 2 | var cnt = 0; 3 | 4 | while (num != 1 && cnt < 500) { 5 | num = num % 2 === 0 ? num / 2 : num * 3 + 1; 6 | cnt++; 7 | } 8 | 9 | return num === 1 ? cnt : -1; 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/yeeun.js: -------------------------------------------------------------------------------- 1 | function solution(num) { 2 | var answer = 0; 3 | while(num!=1){ 4 | num=(num%2==0)?num/2:(num%2==1)?num*3+1:0; 5 | answer++; 6 | } 7 | return (answer>=500)?-1:answer; 8 | } 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.콜라츠_추측/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int num) { 3 | int answer = 0; 4 | long NUM=num; 5 | if(num==1)return 0; 6 | for(int i=0; i<500; i++) { 7 | NUM=NUM%2==0?NUM/2:NUM*3+1; 8 | //System.out.println(NUM); 9 | if(NUM==1)return i+1; 10 | } 11 | return -1; 12 | } 13 | } -------------------------------------------------------------------------------- /programmers/난이도별/level01.크레인_인형뽑기_게임/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(board, moves): 2 | answer = 0 3 | stack = [] 4 | 5 | for i in moves : 6 | i = i - 1 7 | for j in board : 8 | if j[i] != 0 : 9 | stack.append(j[i]) 10 | j[i] = 0 11 | length = len(stack) - 1 12 | 13 | if length > 0 : 14 | if stack[length] == stack[length - 1] : 15 | del stack[length] 16 | del stack[length - 1] 17 | answer = answer + 2 18 | break 19 | 20 | return answer 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.평균_구하기/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | double solution(int arr[], size_t arr_len) { 6 | double answer = 0; 7 | for(int i=0; i prev + current 4 | ); 5 | 6 | return sum / arr.length; 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.평균_구하기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(arr) { 2 | return arr.reduce((x, y)=>x+y)/arr.length; 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.평균_구하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public double solution(int[] arr) { 3 | double answer = 0; 4 | 5 | for(int i : arr) 6 | answer += i; 7 | 8 | return answer / arr.length; 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.평균_구하기/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(arr): 2 | return sum(arr) / len(arr) 3 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.평균_구하기/Suhyeon.java: -------------------------------------------------------------------------------- 1 | class Suhyeon { 2 | public double Suhyeon(int[] arr) { 3 | double answer = 0; 4 | int count = 0; 5 | 6 | for(int i = 0; i < arr.length; i++){ 7 | answer += arr[i]; 8 | count++; 9 | } 10 | 11 | return (answer/count); 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.평균_구하기/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(arr) { 2 | return arr.reduce((prev, cur) => prev + cur, 0) / arr.length; 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.평균_구하기/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | public class yoojinhee03 { 4 | 5 | public static void main(String[] args) { 6 | 7 | int[] arr= {1,2,3,4}; 8 | System.out.println(solution(arr)); 9 | 10 | 11 | } 12 | public static double solution(int[] arr) { 13 | double answer = 0; 14 | for(int i:arr) { 15 | answer+=i; 16 | } 17 | return answer/arr.length; 18 | } 19 | } -------------------------------------------------------------------------------- /programmers/난이도별/level01.폰켓몬/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(nums) { 2 | const maxChose = nums.length / 2; 3 | const deleteOverLap = new Set(nums); 4 | const deleteOverLapSize = deleteOverLap.size; 5 | 6 | return deleteOverLapSize >= maxChose ? maxChose : deleteOverLapSize; 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.폰켓몬/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | import java.util.stream.Collectors; 3 | 4 | class Solution { 5 | public int solution(int[] nums) { 6 | Set set = new HashSet<>(); 7 | 8 | for(int num : nums) 9 | set.add(num); 10 | 11 | int setLen = set.size(); 12 | int max = nums.length / 2; 13 | 14 | return setLen > max? max : setLen; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.폰켓몬/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(nums) { 2 | const distinctNums = new Set([...nums]); 3 | const distinctNumsCount = [...distinctNums].length; 4 | const maxChoose = nums.length/2; 5 | 6 | return maxChoose >= distinctNumsCount ? distinctNumsCount : maxChoose; 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.폰켓몬/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(nums) { 2 | var n = nums.length / 2; 3 | var unique = [...new Set(nums)].length; 4 | 5 | return (n < unique) ? n : unique; 6 | } 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.하샤드_수/JiaLee0707.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | bool solution(int x) { 6 | bool answer = true; 7 | 8 | int xx = x; 9 | int sum = 0; 10 | 11 | while (xx != 0) { 12 | sum += xx % 10; 13 | xx /= 10; 14 | } 15 | 16 | if (x % sum != 0) answer = false; 17 | 18 | return answer; 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.하샤드_수/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(x) { 2 | return !(x%[...(x+"")].reduce((a,b) => +a + +b)); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.하샤드_수/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public boolean solution(int x) { 3 | boolean answer = true; 4 | 5 | int x2 = x; 6 | int sum = 0; 7 | 8 | while(x2 > 0) { 9 | sum += x2 % 10; 10 | x2 /= 10; 11 | } 12 | 13 | if(x % sum != 0) 14 | answer = false; 15 | 16 | return answer; 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.하샤드_수/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(x): 2 | st = list(str(x)) 3 | h = 0 4 | for i in st : 5 | h = h + int(i) 6 | return True if x % h == 0 else False 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.하샤드_수/areum.js: -------------------------------------------------------------------------------- 1 | function solution(x) { 2 | var sum = 0; 3 | var arr = (x+'').split(''); 4 | 5 | for(let i=0; i 2 | #include 3 | #include 4 | 5 | // 파라미터로 주어지는 문자열은 const로 주어집니다. 변경하려면 문자열을 복사해서 사용하세요. 6 | char* solution(const char* phone_number) { 7 | // return 값은 malloc 등 동적 할당을 사용해주세요. 할당 길이는 상황에 맞게 변경해주세요. 8 | char* answer = (char*)malloc(1); 9 | strcpy(answer, phone_number); 10 | 11 | for (int i = 0; i < strlen(answer) - 4; i++) { 12 | answer[i] = '*'; 13 | } 14 | 15 | printf("%s", answer); 16 | 17 | return answer; 18 | } 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.핸드폰_번호_가리기/Leemainsw.js: -------------------------------------------------------------------------------- 1 | function solution(phone_number) { 2 | const phone_num_sub = phone_number.length - 4; 3 | 4 | // 현재 문자열을 주어진 횟수만큼 반복해 붙인 새로운 문자열을 반환한다. 5 | // *을 받은 phone_number의 length보다 -4 만큼의 길이까지 *로 반복해 반환한다. 6 | return '*'.repeat(phone_num_sub) + phone_number.substring(phone_num_sub) 7 | } 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.핸드폰_번호_가리기/Moon-Hyekyung.js: -------------------------------------------------------------------------------- 1 | function solution(phone_number) { 2 | for(let i = 0; i= len - 4) { 7 | answer += phone_number[i]; 8 | } else { 9 | answer += "*"; 10 | } 11 | } 12 | 13 | return answer; 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.행렬의_덧셈/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[][] solution(int[][] arr1, int[][] arr2) { 3 | int[][] answer = new int[arr1.length][arr1[0].length]; 4 | 5 | for(int i = 0; i < arr1.length; i++) { 6 | for(int j = 0; j < arr1[i].length; j++) { 7 | answer[i][j] = arr1[i][j] + arr2[i][j]; 8 | } 9 | } 10 | 11 | return answer; 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.행렬의_덧셈/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(arr1, arr2): 2 | len1 = len(arr1) 3 | len2 = len(arr1[0]) 4 | answer = [[arr1[i][j] + arr2[i][j] for j in range(0, len2)] for i in range(0, len1)] 5 | return answer 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.행렬의_덧셈/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(arr1, arr2) { 2 | var answer = []; 3 | 4 | for (var i = 0; i < arr1.length; i++) { 5 | var temp = []; 6 | for (var j = 0; j < arr1[0].length; j++) { 7 | temp.push(arr1[i][j] + arr2[i][j]); 8 | } 9 | answer.push(temp); 10 | } 11 | 12 | return answer; 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.행렬의_덧셈/y2ny.js: -------------------------------------------------------------------------------- 1 | function solution(arr1, arr2) { 2 | return arr1.flatMap((e, index1) => [e.flatMap((ee, index2) => [ee + arr2[index1][index2]])]); 3 | } 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level01.행렬의_덧셈/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[][] solution(int[][] arr1, int[][] arr2) { 3 | int[][] answer = new int[arr1.length][arr1[0].length]; 4 | for(int i = 0; i < arr1.length; i ++){ 5 | for(int j = 0; j < arr1[i].length; j ++){ 6 | answer[i][j] = arr1[i][j] + arr2[i][j]; 7 | } 8 | } 9 | 10 | return answer; 11 | } 12 | } -------------------------------------------------------------------------------- /programmers/난이도별/level02.124_나라의_숫자/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(int n) { 3 | String[] numbers = {"4", "1", "2"}; 4 | StringBuffer answer = new StringBuffer(); 5 | 6 | while(n > 0) { 7 | answer.insert(0, numbers[n % 3]); 8 | n = (n - 1) / 3; 9 | } 10 | 11 | return answer.toString(); 12 | } 13 | } 14 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.DATETIME에서_DATE로_형_변환/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name, TO_CHAR(datetime, 'YYYY-MM-DD') 2 | FROM animal_ins 3 | ORDER BY 1; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.DATETIME에서_DATE로_형_변환/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, TO_CHAR(DATETIME,'RRRR-MM-DD') AS 날짜 2 | FROM ANIMAL_INS 3 | ORDER BY ANIMAL_ID; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.DATETIME에서_DATE로_형_변환/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, TO_CHAR(DATETIME, 'YYYY-MM-DD') AS "날짜" 2 | FROM ANIMAL_INS 3 | ORDER BY ANIMAL_ID; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.H-Index/JiaLee0707.js: -------------------------------------------------------------------------------- 1 | function solution(citations) { 2 | let HIndex = citations.length + 1; 3 | let HindexThem; 4 | 5 | do { 6 | HIndex--; 7 | HindexThem = citations.filter((value) => HIndex <= value); 8 | } while(HIndex > HindexThem.length); 9 | 10 | return HIndex; 11 | } 12 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.H-Index/Leemainsw.js: -------------------------------------------------------------------------------- 1 | const sorting = (a,b) => b-a; 2 | 3 | function solution(citations) { 4 | let hIndex = 0; 5 | 6 | // 내림차순 정렬 7 | citations = citations.sort(sorting); 8 | 9 | // h번 이상 인용된 논문이 h편 이상 인 부분 10 | // hIndex의 값을 0부터 1씩 증가시키면서 11 | // 해당 값을 배열의 인덱스로 비교합니다. 12 | // 작은 값을 배열에서 발견(적은 인용 횟수)하면 반복문을 종료하고 값을 return 13 | while(hIndex + 1 <= citations[hIndex]){ 14 | hIndex++; 15 | } 16 | 17 | return hIndex; 18 | } 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.H-Index/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public int solution(int[] citations) { 5 | int answer = 0; 6 | Arrays.sort(citations); 7 | 8 | int index = citations[citations.length - 1]; 9 | while(true) { 10 | answer = index--; 11 | int cnt = 0; 12 | 13 | for(int i = 0; i < citations.length; i++) 14 | cnt += answer <= citations[i] ? 1 : 0; 15 | 16 | if(answer <= cnt || index < 0) 17 | break; 18 | } 19 | 20 | return answer; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.JadenCase_문자열 만들기/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public String solution(String s) { 3 | String answer = ""; 4 | 5 | s = s.toLowerCase(); 6 | int len = s.length(); 7 | 8 | answer += Character.toUpperCase(s.charAt(0)); 9 | 10 | for(int i = 1; i < len; i++) { 11 | char ch = s.charAt(i); 12 | answer += (ch != ' ')? 13 | (s.charAt(i - 1) == ' ')? Character.toUpperCase(ch) 14 | : ch : " "; 15 | } 16 | 17 | return answer; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.JadenCase_문자열 만들기/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | var answer = ''; 3 | let str = (s.toLowerCase()+"").split(''); 4 | const strlen = str.length; 5 | answer += str[0].toUpperCase(); 6 | 7 | for (let i=1; i < strlen; i++){ 8 | if(str[i-1] == ' '){ 9 | answer += str[i].toUpperCase(); 10 | continue; 11 | } 12 | answer += str[i]; 13 | } 14 | 15 | return answer; 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.NULL_처리하기/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_type, NVL(name, 'No name') name, sex_upon_intake 2 | FROM animal_ins 3 | ORDER BY animal_id; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.NULL_처리하기/Suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_TYPE, NVL(NAME, 'No name') AS NAME, SEX_UPON_INTAKE 2 | FROM ANIMAL_INS 3 | ORDER BY ANIMAL_ID; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.NULL_처리하기/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_TYPE, NVL(NAME, 'No name'), SEX_UPON_INTAKE 2 | FROM ANIMAL_INS 3 | ORDER BY ANIMAL_ID; 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.NULL_처리하기/sokkanji.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_type, NVL(name, 'No name') name, sex_upon_intake FROM animal_ins ORDER BY animal_id; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.NULL_처리하기/yoojinhee03.sql: -------------------------------------------------------------------------------- 1 | -- 코드를 입력하세요 2 | SELECT ANIMAL_TYPE, ifnull(name,'No name'), SEX_UPON_INTAKE from ANIMAL_INS; -------------------------------------------------------------------------------- /programmers/난이도별/level02.가장_큰_수/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public String solution(int[] numbers) { 5 | String answer = ""; 6 | List list = new ArrayList(); 7 | for (int i = 0; i < numbers.length; i++) 8 | list.add(Integer.toString(numbers[i])); 9 | 10 | list.sort((String a, String b) -> 11 | (b + a).compareTo(a + b)); 12 | 13 | answer = String.join("", list); 14 | return answer.startsWith("0")? "0" : answer; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.가장_큰_수/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(numbers) { 2 | var result = numbers.join(';') 3 | .split(';') 4 | .sort((a, b) => a+b > b+a ? -1 : 1) 5 | .join(''); 6 | 7 | return result.slice(0, 1) === "0" ? "0" : result; 8 | } 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.게임_맵_최단거리/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(maps) { 2 | const row = maps.length; 3 | const col = maps[0].length; 4 | 5 | const direction = [[0, -1], [1, 0], [0, 1], [-1, 0]]; 6 | const queue = [[0, 0]]; 7 | let distance = Array.from(Array(row), () => Array(col).fill(1)); 8 | 9 | while (queue.length > 0) { 10 | const [y, x] = queue.shift(); 11 | 12 | for (const [dy, dx] of direction) { 13 | const nx = x + dx; 14 | const ny = y + dy; 15 | 16 | if (nx >= 0 && ny >= 0 && nx < col && ny < row) { 17 | if (maps[ny][nx] === 1 && distance[ny][nx] === 1) { 18 | distance[ny][nx] = distance[y][x] + 1; 19 | queue.push([ny, nx]); 20 | } 21 | } 22 | } 23 | } 24 | 25 | return distance[row - 1][col - 1] === 1 ? -1 : distance[row - 1][col - 1]; 26 | } 27 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.고양이와_개는_몇_마리_있을까/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_type, COUNT(*) count 2 | FROM animal_ins 3 | GROUP BY animal_type 4 | ORDER BY 1; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.고양이와_개는_몇_마리_있을까/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_type, COUNT(*) count 2 | FROM animal_ins 3 | GROUP BY animal_type 4 | ORDER BY animal_type ASC; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.고양이와_개는_몇_마리_있을까/yeeun.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_TYPE,COUNT(*) FROM ANIMAL_INS GROUP BY ANIMAL_TYPE ORDER BY ANIMAL_TYPE; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.기능개발/yoojinhee03.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Mirim-Study/Algorithm/8281f02f504b8c3d23a269d84b3f2acb7ce0ceb5/programmers/난이도별/level02.기능개발/yoojinhee03.java -------------------------------------------------------------------------------- /programmers/난이도별/level02.다음_큰_숫자/SSSOy.py: -------------------------------------------------------------------------------- 1 | def solution(n): 2 | answer = 0 3 | cnt = cntOne(n) 4 | 5 | while True : 6 | n = n + 1 7 | if cnt == cntOne(n) : 8 | answer = n 9 | break 10 | 11 | return answer 12 | 13 | def cntOne(n) : 14 | st = str(bin(n))[2:] 15 | return st.count('1') 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.다음_큰_숫자/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(n) { 2 | var answer = n; 3 | var cnt = n.toString(2).match(/1/g).length; 4 | 5 | while (answer++) { 6 | if (cnt === answer.toString(2).match(/1/g).length) 7 | return answer; 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.더_맵게/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public int solution(int[] scoville, int K) { 5 | int answer = 0; 6 | PriorityQueue q = new PriorityQueue<>(); 7 | for(int i : scoville) 8 | q.add(i); 9 | 10 | while(q.size() > 1) { 11 | if(q.peek() >= K) 12 | break; 13 | q.add(q.poll() + q.poll() * 2); 14 | answer++; 15 | } 16 | 17 | return q.peek() >= K? answer : -1; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.더_맵게/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.PriorityQueue; 2 | 3 | class Solution { 4 | public int solution(int[] scoville, int K) { 5 | int answer = 0; 6 | PriorityQueue score = new PriorityQueue<>(); 7 | 8 | for (int i : scoville) { 9 | score.add(i); 10 | } 11 | 12 | while (score.size() > 1) { 13 | if (score.peek() >= K) break; 14 | score.add(score.poll() + score.poll() * 2); 15 | answer++; 16 | } 17 | 18 | return score.peek() >= K ? answer : -1; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.더_맵게/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public int solution(int[] scoville, int K) { 5 | int answer = 0; 6 | PriorityQueue priorityQueue = new PriorityQueue<>(); 7 | for(int scov:scoville) { 8 | priorityQueue.offer(scov); 9 | } 10 | // System.out.println(priorityQueue.peek()); 11 | while((int)priorityQueue.peek() 1) { 12 | answer++; 13 | priorityQueue.offer(priorityQueue.poll()+(priorityQueue.poll()*2)); 14 | //System.out.println(priorityQueue); 15 | } 16 | return priorityQueue.peek() < K ? -1 : answer; 17 | } 18 | } -------------------------------------------------------------------------------- /programmers/난이도별/level02.동명_동물_수_찾기/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT NAME, COUNT(NAME) COUNT 2 | FROM ANIMAL_INS 3 | GROUP BY NAME 4 | HAVING COUNT(NAME) >= 2 5 | ORDER BY 1; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.동명_동물_수_찾기/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT name, COUNT(NAME) COUNT 2 | FROM animal_ins 3 | GROUP BY name 4 | HAVING COUNT(NAME) > 1 5 | ORDER BY name; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.동물_수_구하기/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT count(*) count from animal_ins; 2 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.루시와_엘라_찾기/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, SEX_UPON_INTAKE 2 | FROM ANIMAL_INS 3 | WHERE NAME IN ('Luch', 'Ella', 'Pickle', 'Sabrina', 'Mitty') 4 | ORDER BY ANIMAL_ID; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.루시와_엘라_찾기/Suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, SEX_UPON_INTAKE 2 | FROM ANIMAL_INS 3 | WHERE NAME IN ('Lucy','Ella','Pickle','Rogan','Sabrina','Mitty') 4 | ORDER BY 1; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.루시와_엘라_찾기/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, SEX_UPON_INTAKE 2 | FROM ANIMAL_INS 3 | WHERE NAME IN ('Lucy','Ella','Pickle' ,'Rogan','Sabrina','Mitty'); 4 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.루시와_엘라_찾기/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, SEX_UPON_INTAKE 2 | FROM ANIMAL_INS 3 | WHERE NAME IN ('Lucy', 'Ella', 'Pickle', 'Rogan', 'Sabrina', 'Mitty') 4 | ORDER BY ANIMAL_ID; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.루시와_엘라_찾기/sokkanji.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name, sex_upon_intake 2 | FROM animal_ins 3 | WHERE name IN ('Lucy', 'Ella', 'Pickle', 'Rogan', 'Sabrina', 'Mitty') 4 | ORDER BY animal_id; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.스킬트리/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(String skill, String[] skill_trees) { 3 | int answer = 0; 4 | String[] skillArr = skill.split(""); 5 | 6 | for(String skillTree : skill_trees) { 7 | int skillArrIdx = 0; 8 | boolean flag = true; 9 | 10 | for(String skillCh : skillTree.split("")) { 11 | if(skillArr.length <= skillArrIdx) break; 12 | if(skill.contains(skillCh) && !(skillArr[skillArrIdx].equals(skillCh))) { 13 | flag = false; 14 | break; 15 | } 16 | else if(skillArr[skillArrIdx].equals(skillCh)) skillArrIdx++; 17 | } 18 | 19 | if(flag) answer++; 20 | } 21 | 22 | return answer; 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.예상_대진표/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n, int a, int b) { 3 | int answer = 1; 4 | if (a > b) { 5 | int temp = a; 6 | a = b; 7 | b = temp; 8 | } 9 | 10 | while (!(b - a == 1 && b % 2 == 0)) { 11 | a = (int) Math.ceil((double) a / 2); 12 | b = (int) Math.ceil((double) b / 2); 13 | answer++; 14 | } 15 | 16 | return answer; 17 | } 18 | } 19 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.오픈채팅방/pppeum62.js: -------------------------------------------------------------------------------- 1 | function solution(record) { 2 | var answer = []; 3 | var temp = []; 4 | var userId = new Map; 5 | 6 | for (var i in record) { 7 | temp = record[i].split(" "); 8 | if (temp[2]) 9 | userId.set(temp[1], temp[2]); 10 | } 11 | 12 | for (var i in record) { 13 | temp = record[i].split(" "); 14 | if (temp[0] === "Enter") 15 | answer.push(userId.get(temp[1]) + "님이 들어왔습니다."); 16 | else if (temp[0] === "Leave") 17 | answer.push(userId.get(temp[1]) + "님이 나갔습니다."); 18 | } 19 | 20 | return answer; 21 | } 22 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.올바른_괄호/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | boolean solution(String s) { 3 | int num1 = 1, num2 = 0; 4 | int len = s.length(); 5 | 6 | if(s.charAt(0) == ')' || s.charAt(len - 1) == '(') 7 | return false; 8 | 9 | for(int i = 1; i < len; i++) { 10 | char c = s.charAt(i); 11 | if(c == '(') num1++; 12 | else num2++; 13 | 14 | if(num2 > num1) return false; 15 | } 16 | 17 | return num1 == num2? true : false; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.올바른_괄호/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(s){ 2 | let left = 1; 3 | 4 | // 먼저 ) 가 나오는 문자열은 처음부터 실패 출력 5 | if(s[0] == ')') 6 | return false; 7 | 8 | for(let i=1; i 0) : 15 | s = s + str(int(i % 2)) 16 | i = int(i / 2) 17 | return s 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.이진_변환_반복하기/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | let target = s; 3 | let repeatCount = 0; 4 | let zeroCount = 0; 5 | const regex = new RegExp(/0/, 'g'); 6 | 7 | while(target !== "1"){ 8 | const targetLength = target.length; 9 | const distinctZero = target.replace(regex, ''); 10 | 11 | zeroCount += targetLength - distinctZero.length; 12 | target = (distinctZero.length).toString(2); 13 | repeatCount++; 14 | } 15 | 16 | return [repeatCount, zeroCount]; 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.입양_시각_구하기(1)/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT TO_CHAR(DATETIME, 'hh24') HOUR, COUNT(*) COUNT 2 | FROM ANIMAL_OUTS 3 | WHERE TO_CHAR(DATETIME, 'hh24') BETWEEN 9 AND 19 4 | GROUP BY TO_CHAR(DATETIME, 'hh24') 5 | ORDER BY 1; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.입양_시각_구하기(1)/Suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT EXTRACT(hour from datetime) "HOUR", COUNT(*) "COUNT" from ANIMAL_OUTS 2 | WHERE EXTRACT(hour from datetime) >= 9 && EXTRACT(hour from datetime) < 20 3 | GROUP BY 1 4 | ORDER BY 1; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.입양_시각_구하기(1)/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT HOUR(datetime) HOUR, COUNT(*) COUNT 2 | FROM animal_outs 3 | GROUP BY HOUR 4 | HAVING HOUR BETWEEN 9 AND 19 5 | ORDER BY 1 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.전화번호_목록/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public boolean solution(String[] phone_book) { 5 | boolean answer = true; 6 | Arrays.sort(phone_book); 7 | 8 | for(int i = 0; i < phone_book.length && answer; i++) { 9 | for(int j = i + 1; j < phone_book.length && answer; j++) { 10 | int len_i = phone_book[i].length(); 11 | int len_j = phone_book[j].length(); 12 | if(len_i <= len_j && phone_book[i].equals(phone_book[j].substring(0, len_i))) { 13 | answer = false; 14 | } 15 | } 16 | } 17 | 18 | return answer; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.전화번호_목록/pppeum62.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | 3 | class Solution { 4 | public boolean solution(String[] phone_book) { 5 | boolean answer = true; 6 | Arrays.sort(phone_book); 7 | 8 | for(int i = 0; i < phone_book.length - 1; i++) { 9 | if(phone_book[i + 1].indexOf(phone_book[i]) == 0) { 10 | answer = false; 11 | break; 12 | } 13 | } 14 | 15 | return answer; 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.주식가격/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[] solution(int[] prices) { 3 | int[] answer = new int[prices.length]; 4 | 5 | for(int i = 0; i < prices.length - 1; i++) { 6 | for(int j = i + 1; j < prices.length; j++) { 7 | if(prices[i] > prices[j]) { 8 | answer[i] = j - i; 9 | break; 10 | } 11 | } 12 | if(answer[i] == 0) answer[i] = prices.length - i - 1; 13 | } 14 | 15 | return answer; 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.주식가격/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[] solution(int[] prices) { 3 | int[] answer = new int[prices.length]; 4 | int idx=0; 5 | for(int i=0; iprices[j]) { 9 | answer[i]=idx;break; 10 | }else { 11 | answer[i]=prices.length-i-1; 12 | } 13 | } 14 | idx=0; 15 | } 16 | return answer; 17 | } 18 | } -------------------------------------------------------------------------------- /programmers/난이도별/level02.중성화_여부_파악하기/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, CASE WHEN SEX_UPON_INTAKE LIKE 'Intact%' THEN 'X' 2 | ELSE 'O' 3 | END 중성화 4 | FROM ANIMAL_INS 5 | ORDER BY 1; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.중성화_여부_파악하기/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, 2 | CASE WHEN SEX_UPON_INTAKE LIKE 'Neutered%' OR SEX_UPON_INTAKE LIKE 'Spayed%' THEN 'O' 3 | ELSE 'X' 4 | END "중성화" 5 | FROM ANIMAL_INS 6 | ORDER BY ANIMAL_ID 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.중성화_여부_파악하기/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME, 2 | CASE 3 | WHEN (SEX_UPON_INTAKE LIKE '%Neutered%') THEN 'O' 4 | WHEN (SEX_UPON_INTAKE LIKE '%Spayed%') THEN 'O' 5 | ELSE 'X' 6 | END AS "중성화" 7 | FROM ANIMAL_INS 8 | ORDER BY ANIMAL_ID; 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.짝지어_제거하기/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.Stack; 2 | 3 | class Solution 4 | { 5 | public int solution(String s) 6 | { 7 | Stack st = new Stack<>(); 8 | 9 | for(char c : s.toCharArray()) { 10 | if(!st.empty()) { 11 | if(st.peek() == c) 12 | st.pop(); 13 | else 14 | st.add(c); 15 | } 16 | else 17 | st.add(c); 18 | } 19 | 20 | return st.size() == 0? 1 : 0; 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.최댓값과_최솟값/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public String solution(String s) { 5 | String[] arr = s.split(" "); 6 | List list = new ArrayList(); 7 | 8 | for(String a : arr) 9 | list.add(Integer.parseInt(a)); 10 | 11 | int min = Collections.min(list); 12 | int max = Collections.max(list); 13 | 14 | return min + " " + max; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.최댓값과_최솟값/areumsheep.js: -------------------------------------------------------------------------------- 1 | function solution(s) { 2 | var str = s.split(' '); 3 | return Math.min.apply(null,str) + ' ' + Math.max.apply(null,str); 4 | } 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.최솟값_만들기/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | 3 | class Solution { 4 | public int solution(int []A, int []B) { 5 | int answer = 0; 6 | Arrays.sort(A); 7 | Arrays.sort(B); 8 | 9 | for(int i = 0; i < A.length; i++) 10 | answer += A[i] * B[B.length - (i + 1)]; 11 | 12 | return answer; 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.카펫/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[] solution(int brown, int yellow) { 3 | int[] answer = new int[2]; 4 | int row,col;//°¡·Î ¼¼·Î 5 | System.out.println((brown+4)/2); 6 | for(int i=1; i<=(brown+4)/4; i++) { 7 | 8 | col=i; 9 | row=(brown+4)/2-col; 10 | if(col*row==brown+yellow) { 11 | answer[0]=row; 12 | answer[1]=col; 13 | break; 14 | 15 | } 16 | } 17 | return answer; 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.프린터/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.*; 2 | 3 | class Solution { 4 | public int solution(int[] priorities, int location) { 5 | int answer = 0; 6 | List list = new ArrayList(); 7 | for(int i : priorities) 8 | list.add(i); 9 | 10 | while(true) { 11 | if(location == 0 && list.get(location) >= Collections.max(list)) 12 | break; 13 | if(list.get(0) >= Collections.max(list)) { 14 | list.remove(0); 15 | location--; 16 | answer++; 17 | } 18 | else { 19 | list.add(list.get(0)); 20 | list.remove(0); 21 | location = location == 0? list.size() - 1 : location - 1; 22 | } 23 | } 24 | 25 | return answer + 1; 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.피보나치_수/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(long n) { 3 | int answer = 0; 4 | int a = 1, b = 1; 5 | 6 | for(int i = 1; i < n - 1; i++) { 7 | answer = ((a % 1234567) + (b % 1234567)) % 1234567; 8 | a = b % 1234567; 9 | b = answer; 10 | } 11 | 12 | return answer; 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /programmers/난이도별/level02.피보나치_수/yoojinhee03.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int solution(int n) { 3 | int answer = 0; 4 | int n1=0,n2=1; 5 | for(int i=2; i<=n; i++) { 6 | answer= n1%1234567+n2%1234567; 7 | n1=n2; 8 | n2=answer; 9 | } 10 | return answer%1234567; 11 | } 12 | } -------------------------------------------------------------------------------- /programmers/난이도별/level02.행렬의_곱셈/SSSOy.java: -------------------------------------------------------------------------------- 1 | class Solution { 2 | public int[][] solution(int[][] arr1, int[][] arr2) { 3 | int[][] answer = new int[arr1.length][arr2[0].length]; 4 | 5 | for(int i = 0; i < arr1.length; i++) { 6 | for(int j = 0; j < arr2[0].length; j++) { 7 | for(int h = 0; h < arr1[0].length; h++) { 8 | answer[i][j] += arr1[i][h] * arr2[h][j]; 9 | } 10 | } 11 | } 12 | 13 | return answer; 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.숫자_게임/SSSOy.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | 3 | class Solution { 4 | public int solution(int[] A, int[] B) { 5 | int answer = 0; 6 | Arrays.sort(A); 7 | Arrays.sort(B); 8 | 9 | int BIndex = 0; 10 | for(int i = 0; i < A.length; i++, BIndex++) { 11 | if(BIndex >= B.length) break; 12 | // if(A[i] == B[BIndex]) continue; 13 | 14 | if(A[i] < B[BIndex]) { 15 | answer++; 16 | } else { 17 | i--; 18 | } 19 | } 20 | 21 | return answer; 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.없어진_기록_찾기/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME 2 | FROM ANIMAL_OUTS 3 | WHERE ANIMAL_ID NOT IN (SELECT ANIMAL_ID FROM ANIMAL_INS) 4 | ORDER BY 1; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.없어진_기록_찾기/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT O.ANIMAL_ID, O.NAME 2 | FROM ANIMAL_INS I RIGHT JOIN ANIMAL_OUTS O 3 | ON I.ANIMAL_ID = O.ANIMAL_ID 4 | WHERE I.ANIMAL_ID IS NULL 5 | ORDER BY 1; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.없어진_기록_찾기/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT animal_id, name 2 | FROM animal_outs 3 | MINUS 4 | SELECT animal_id, name 5 | FROM animal_ins 6 | ORDER BY animal_id; 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.오랜_기간_보호한_동물(1)/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT INS.NAME, INS.DATETIME 2 | FROM ANIMAL_INS INS 3 | WHERE INS.ANIMAL_ID NOT IN (SELECT ANIMAL_ID FROM ANIMAL_OUTS) 4 | ORDER BY DATETIME 5 | LIMIT 3; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.오랜_기간_보호한_동물(1)/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT I.NAME, I.DATETIME 2 | FROM ANIMAL_INS I LEFT OUTER JOIN ANIMAL_OUTS O ON I.ANIMAL_ID = O.ANIMAL_ID 3 | WHERE O.ANIMAL_ID IS NULL 4 | ORDER BY I.DATETIME 5 | LIMIT 3; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.오랜_기간_보호한_동물(1)/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ins.name, ins.datetime 2 | FROM animal_ins ins 3 | LEFT JOIN animal_outs outs 4 | ON ins.animal_id = outs.animal_id 5 | WHERE outs.animal_id IS NULL 6 | ORDER BY ins.datetime 7 | LIMIT 3; 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.오랜_기간_보호한_동물(2)/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME 2 | FROM (SELECT I.ANIMAL_ID, I.NAME 3 | FROM ANIMAL_INS I JOIN ANIMAL_OUTS O ON I.ANIMAL_ID = O.ANIMAL_ID 4 | ORDER BY O.DATETIME - I.DATETIME DESC) 5 | WHERE ROWNUM <= 2; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.오랜_기간_보호한_동물(2)/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT I.ANIMAL_ID, I.NAME 2 | FROM ANIMAL_INS I, ANIMAL_OUTS O 3 | WHERE I.ANIMAL_ID = O.ANIMAL_ID 4 | ORDER BY O.DATETIME - I.DATETIME 5 | DESC LIMIT 2; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.오랜_기간_보호한_동물(2)/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ins.animal_id, ins.name 2 | FROM animal_ins ins, animal_outs outs 3 | WHERE ins.animal_id = outs.animal_id 4 | ORDER BY (outs.datetime - ins.datetime) DESC 5 | LIMIT 2; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.있었는데요_없었습니다/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT I.ANIMAL_ID, I.NAME 2 | FROM ANIMAL_INS I, ANIMAL_OUTS O 3 | WHERE I.ANIMAL_ID = O.ANIMAL_ID AND I.DATETIME > O.DATETIME 4 | ORDER BY I.DATETIME; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.있었는데요_없었습니다/Suhyeon.sql: -------------------------------------------------------------------------------- 1 | SELECT ins.ANIMAL_ID, outs.NAME 2 | FROM ANIMAL_INS ins, ANIMAL_OUTS outs 3 | WHERE ins.ANIMAL_ID = outs.ANIMAL_ID 4 | AND ins.datetime > outs.datetime 5 | ORDER BY ins.datetime; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.있었는데요_없었습니다/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT ANIMAL_ID, NAME 2 | FROM ANIMAL_INS 3 | WHERE DATETIME > (SELECT DATETIME FROM ANIMAL_OUTS WHERE ANIMAL_INS.ANIMAL_ID = ANIMAL_OUTS.ANIMAL_ID) 4 | ORDER BY DATETIME; 5 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.있었는데요_없었습니다/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ins.ANIMAL_ID, ins.NAME 2 | FROM ANIMAL_INS ins 3 | JOIN ANIMAL_OUTS outs 4 | ON ins.ANIMAL_ID = outs.ANIMAL_ID 5 | AND ins.DATETIME > outs.DATETIME 6 | ORDER BY ins.DATETIME; 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.헤비_유저가_소유한_장소/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT * 2 | FROM PLACES P 3 | WHERE (SELECT COUNT(*) 4 | FROM PLACES 5 | WHERE HOST_ID = P.HOST_ID) > 1 6 | ORDER BY ID; 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level03.헤비_유저가_소유한_장소/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT * 2 | FROM PLACES 3 | WHERE host_id IN (( 4 | SELECT host_id 5 | FROM PLACES 6 | GROUP BY host_id 7 | HAVING COUNT(*) >= 2)) 8 | ORDER BY id; 9 | -------------------------------------------------------------------------------- /programmers/난이도별/level04.보호소에서_중성화한_동물/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT I.ANIMAL_ID, I.ANIMAL_TYPE, I.NAME 2 | FROM ANIMAL_INS I, ANIMAL_OUTS O 3 | WHERE I.ANIMAL_ID = O.ANIMAL_ID 4 | AND SUBSTR(I.SEX_UPON_INTAKE, 0, INSTR(I.SEX_UPON_INTAKE, ' ') - 1) = 'Intact' 5 | AND SUBSTR(O.SEX_UPON_OUTCOME, 0, INSTR(O.SEX_UPON_OUTCOME, ' ') - 1) IN ('Spayed', 'Neutered') 6 | ORDER BY 1; 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level04.보호소에서_중성화한_동물/areumsheep.sql: -------------------------------------------------------------------------------- 1 | SELECT INS.ANIMAL_ID, INS.ANIMAL_TYPE, INS.NAME 2 | FROM ANIMAL_INS INS 3 | INNER JOIN ANIMAL_OUTS OUTS ON INS.ANIMAL_ID = OUTS.ANIMAL_ID 4 | WHERE INS.ANIMAL_ID = OUTS.ANIMAL_ID 5 | AND INS.SEX_UPON_INTAKE LIKE 'Intact%' AND OUTS.SEX_UPON_OUTCOME IN('Neutered Male', 'Spayed Female') 6 | ORDER BY INS.ANIMAL_ID ASC; 7 | -------------------------------------------------------------------------------- /programmers/난이도별/level04.보호소에서_중성화한_동물/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT ins.ANIMAL_ID, ins.ANIMAL_TYPE, ins.NAME 2 | FROM ANIMAL_INS ins 3 | JOIN ANIMAL_OUTS outs 4 | ON ins.ANIMAL_ID = outs.ANIMAL_ID 5 | AND ins.SEX_UPON_INTAKE LIKE 'intact%' 6 | AND outs.SEX_UPON_OUTCOME NOT LIKE 'intact%' 7 | ORDER BY ANIMAL_ID; 8 | -------------------------------------------------------------------------------- /programmers/난이도별/level04.우유와_요거트가_담긴_장바구니/SSSOy.sql: -------------------------------------------------------------------------------- 1 | SELECT DISTINCT CART_ID 2 | FROM CART_PRODUCTS C 3 | WHERE (CART_ID, 'Yogurt') IN (SELECT CART_ID, NAME FROM CART_PRODUCTS WHERE C.CART_ID = CART_ID) 4 | AND (CART_ID, 'Milk') IN (SELECT CART_ID, NAME FROM CART_PRODUCTS WHERE C.CART_ID = CART_ID) 5 | ORDER BY 1; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level04.우유와_요거트가_담긴_장바구니/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT a.CART_ID 2 | FROM CART_PRODUCTS a, CART_PRODUCTS b 3 | WHERE a.CART_ID = b.CART_ID 4 | AND a.NAME = 'Milk' 5 | AND b.NAME = 'Yogurt'; 6 | -------------------------------------------------------------------------------- /programmers/난이도별/level04.특정_세대의_대장균_찾기/pppeum62.sql: -------------------------------------------------------------------------------- 1 | SELECT 2 | G3.ID 3 | FROM 4 | ( 5 | SELECT 6 | G2.ID 7 | FROM 8 | ECOLI_DATA G1 9 | , ECOLI_DATA G2 10 | WHERE 11 | G1.PARENT_ID IS NULL 12 | AND G1.ID = G2.PARENT_ID 13 | ) G2 14 | , ECOLI_DATA G3 15 | WHERE 16 | G2.ID = G3.PARENT_ID 17 | ORDER BY 18 | G3.ID 19 | ; 20 | --------------------------------------------------------------------------------