본문 바로가기

전체 글4129

[LeetCode/Java] Count Commas in Range -Codepublic class LeetCode3870 { // Count Commas in Range public int countCommas(int n) { return Math.max(n - 999, 0); }} 2026. 11. 18.
[LeetCode/Java] Minimum Number of Chairs in a Waiting Room -Codepublic class LeetCode3168 { // Minimum Number of Chairs in a Waiting Room public int minimumChairs(String s) { int maxCnt = 0, nowCnt = 0; for (int i = 0; i 2026. 11. 17.
[LeetCode/Java] Count Elements With Maximum Frequency -Codeimport java.util.*;public class LeetCode3005 { // Count Elements With Maximum Frequency public int maxFrequencyElements(int[] nums) { Map map = new HashMap(); for (int num : nums) { map.put(num, map.getOrDefault(num, 0) + 1); } int maxCnt = 0; for (int num : nums) { maxCnt = Math.max(maxCnt, map.get(num)); } .. 2026. 11. 16.
[LeetCode/Java] Self Dividing Numbers -Codeimport java.util.ArrayList;import java.util.List;public class LeetCode728 { // Self Dividing Numbers public List selfDividingNumbers(int left, int right) { List ans = new ArrayList(); for (int num = left; num 2026. 11. 15.
[LeetCode/Java] Count Operations to Obtain Zero -Codepublic class LeetCode2169 { // Count Operations to Obtain Zero public int countOperations(int num1, int num2) { int cnt = 0; while (num1 > 0) { cnt++; if (num1 >= num2) { num1 -= num2; } else { num2 -= num1; } } return cnt; }} 2026. 11. 13.
[LeetCode/Java] Number Of Rectangles That Can Form The Largest Square -Codepublic class LeetCode1725 { // Number Of Rectangles That Can Form The Largest Square public int countGoodRectangles(int[][] rectangles) { int len = rectangles.length; int[] squares = new int[len]; int max = 0; for (int i = 0; i 2026. 11. 12.