하이 나윤

https://school.programmers.co.kr/learn/courses/30/lessons/150368 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr emoticons 의 최대 크기는 7이고 할인율은 4가지(10%, 20%, 30%, 40%)이기 때문에 많지 않은 숫자임으로 중복 조합을 사용하였다. /** 1. emoticons 중복조합 2. 중복 조합 경우로 최대 이모티콘 플러스 서비스 유저, 액수 구하기 **/ import java.util.*; class Solution { static int minPercent; static int[]..

https://leetcode.com/problems/search-in-rotated-sorted-array/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com target의 index를 구하는 문제 nums 배열의 크기가 5000이라 for문 하나를 사용해도 문제없이 돌아갔다. class Solution { public int search..

https://leetcode.com/problems/rotting-oranges/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public int orangesRotting(int[][] grid) { Queue queue = new LinkedList(); int total = 0; for(int i ..

https://leetcode.com/problems/sort-colors/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 0ms class Solution { public void sortColors(int[] nums) { int[] count = new int[3]; for(int num: nums) { count[num]++; }..

https://leetcode.com/problems/missing-number/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 6ms class Solution { public int missingNumber(int[] nums) { Arrays.sort(nums); int start = -1; boolean in = false; fo..

https://leetcode.com/problems/move-zeroes/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 별도의 array 만들기 없이 in-place로 만드는 것이 조건 44ms class Solution { public void moveZeroes(int[] nums) { for(int i = 0; i < nums...

https://leetcode.com/problems/same-tree/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 0ms /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * Tre..

https://leetcode.com/problems/longest-palindrome/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com /** 1. 문제 해석하기 가장 긴 palindrome 만들기 2. 문제 풀이 방향 홀수는 한개(가장 긴 홀수를 찾아야함) 짝수는 전부 하면 무조건 palindrome을 만들 수 있을 것 같음. */ c..

https://leetcode.com/problems/palindrome-number/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 내친김에 palindrome 하나 더 풀었다. 반씩 비교한 풀이 6ms class Solution { public boolean isPalindrome(int x) { String str = String...

https://leetcode.com/problems/palindrome-linked-list/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com palindrome에 대해서 잘 몰라서 풀이 방식에 대해 찾아보았다. 1. 절반으로 나눠서 비교하는 방법 2. 뒤집은 다음에 같은지 확인하는 방법 1번으로 푼 코드 8ms /** * Definit..