루루의 우당탕탕 개발 스토리 루루의 우당탕탕 개발 스토리

추천 대상 알고리즘 매우 오랜만에 하는 알린이, 새로운 언어로 알고리즘 도전하는 자들에게 문법 정리용

https://leetcode.com/problems/range-sum-query-immutable/?envType=study-plan&id=programming-skills-i Range Sum Query - Immutable - LeetCode 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 NumArray { int[] nums; public NumArray(int[] nums) { this.nums = nums; } public int sumRange(int l..

https://leetcode.com/problems/design-parking-system/?envType=study-plan&id=programming-skills-i Design Parking System - LeetCode 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 ParkingSystem { int big_room, medium_room, small_room; public ParkingSystem(int big, int medium, int small) ..

https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/?envType=study-plan&id=programming-skills-i Sort Integers by The Number of 1 Bits - LeetCode 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[] sortByBits(int[] arr) { Integer[] a = new Integer[ar..

https://leetcode.com/problems/contains-duplicate/?envType=study-plan&id=programming-skills-i Contains Duplicate - LeetCode 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 boolean containsDuplicate(int[] nums) { HashMap map = new HashMap(); for (int num: nums){ if (ma..

https://leetcode.com/problems/valid-anagram/?envType=study-plan&id=programming-skills-i Valid Anagram - LeetCode 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 boolean isAnagram(String s, String t) { String[] s_arr = s.split(""); String[] t_arr = t.split(""); if (s_..

https://leetcode.com/problems/implement-queue-using-stacks/ Implement Queue using Stacks - LeetCode 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 MyQueue { ArrayList arr = new ArrayList(); public MyQueue() { } public void push(int x) { this.arr.add(x); } public int pop() { int tmp =..

https://leetcode.com/problems/sum-of-left-leaves/?envType=study-plan&id=programming-skills-i Sum of Left Leaves - LeetCode 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 { int sum = 0; public int sumOfLeftLeaves(TreeNode root) { solve(root, 0); return this.sum; } public void..