sondevvvv

class Solution { public int[] sortedSquares(int[] nums) { int[] result = new int[nums.length]; int resultIndex = 0; int smallestIndex = 0; int smallestNumber = 0; int leftIndex = 0; int rightIndex = 0; for (int i = 0; i = nums.length) { //right 먼저 소진 result[resultIndex] = nums[leftIndex]; leftIndex--..

class LFUCache { private final int capacity; // Map cache = new HashMap(); // Map frequencyMap = new HashMap(); // > Map> accessSequenceMap = new HashMap(); // : 현존하는 frequency 를 저장 Set frequencySet = new HashSet(); public void expireCache() { Integer smallestFrequency = null; for (Integer frequency : frequencySet) { if (smallestFrequency..