공부하는 블로그

https://leetcode.com/problems/custom-sort-string/description/ 난이도: Medium * DS&A 01 Mar 내 풀이 class Solution { public String customSortString(String order, String s) { int pointer = 0; char[] ca = s.toCharArray(); for(char c: order.toCharArray()){ for(int i=pointer; i Bucket Sort 사용 (이게 정석인듯) class Solution { public String customSortString(String order, String s) { int[] ca = new int[26]; // s에 나..

https://leetcode.com/problems/removing-stars-from-a-string/description/ Removing Stars From a String - LeetCode Can you solve this real interview question? Removing Stars From a String - You are given a string s, which contains stars *. In one operation, you can: * Choose a star in s. * Remove the closest non-star character to its left, as well as remove the star it leetcode.com stack 키워드를 보고 풀기..

https://leetcode.com/problems/contains-duplicate-ii/description/ Contains Duplicate II - LeetCode Can you solve this real interview question? Contains Duplicate II - Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j)

* 버클업 6월 4주차 문자열계산 https://school.programmers.co.kr/learn/courses/30/lessons/120902 class Solution { public int solution(String my_string) { String[] set = my_string.split(" "); int answer = Integer.valueOf(set[0]); for(int i=1; iint 변환해서 sum 함수로 집계 하지만 성능은 별로이다 (Runtime 1.38~1.89ms) 인덱스바꾸기 https://school.programmers.co.kr/learn/courses/30/lessons/120895 1. 생각나는대로 풀어보기 Runtime 0.13~0.20ms 소요 (다소..

* 버클업 6월 3주차 피자나눠먹기 https://school.programmers.co.kr/learn/courses/30/lessons/120816 class Solution { public int solution(int slice, int n) { for(int i=0; i= n){ return i; } } return 0; } } 총 피자조각 slice의 개수가 인원수 n보다 많기만 하면 됨... 간단한 문 중간값 찾기 https://school.programmers.co.kr/learn/courses/30/lessons/120811 import java.util.Arrays; class Solution { public int solution(int[] array) { Arrays.sort(arr..

https://school.programmers.co.kr/learn/courses/30/lessons/120862 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr * 버클업 5월 5째주 import java.util.*; class Solution { public int solution(int[] numbers) { int answer = -100000000; for(int i=0; i

https://school.programmers.co.kr/learn/courses/30/lessons/82612 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr * 버클업 5월 5째주 class Solution { public long solution(int price, int money, int count) { for(int i = 1; i0) { money = 0; } return Math.abs(money); } } 이렇게 했는데 테스트케이스 19~22 통과 실패함... 질문하기 탭 둘러보니 지난주 구슬문제와 마찬가지로 int 범위를 넘어선 문제로 ..

https://leetcode.com/problems/house-robber/ House Robber - LeetCode Can you solve this real interview question? House Robber - You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent ho leetcode.com Dynamic Programming 활용 문제 난이도 : medium * IT's LIT 3주차 class ..

https://leetcode.com/problems/climbing-stairs/ Climbing Stairs - LeetCode Can you solve this real interview question? Climbing Stairs - You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Outpu leetcode.com Dynamic Programming 활용 문제 난이도 : easy * IT's LIT 2주차 class..

https://leetcode.com/problems/two-sum/ Two Sum - LeetCode Can you solve this real interview question? Two Sum - Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not leetcode.com Array 활용 문제 난이도 : easy * IT's LIT 1주차 class Array { // Runtime: 48 ms, ..