본문 바로가기

Java711

[LeetCode/Java] Happy Number -Codeimport java.util.*;public class LeetCode202 { // Happy Number public boolean isHappy(int n) { Set set = new HashSet(); while (true) { int sum = 0; // 각 자리수 제곱의 합 for (char c : String.valueOf(n).toCharArray()) { int num = c - '0'; sum += num * num; } n = sum; // 나온 수면 탈출 .. 2026. 7. 15.
[LeetCode/Java] Single Number -Codeimport java.util.HashMap;import java.util.Map;public class LeetCode136 { // Single Number public int singleNumber(int[] nums) { Map numCnt = new HashMap(); for (int num : nums) { numCnt.put(num, numCnt.getOrDefault(num, 0) + 1); } for (int num : numCnt.keySet()) { if (numCnt.get(num) == 1) { return num; } .. 2026. 7. 14.
[LeetCode/Java] Missing Number -Codepublic class LeetCode268 { // Missing Number public int missingNumber(int[] nums) { // 나온 숫자 체크 boolean[] checkNums = new boolean[nums.length + 1]; for (int num : nums) { checkNums[num] = true; } // 나오지 않은 숫차 찾기 for (int i = 1; i 2026. 7. 13.
[LeetCode/Java] Backspace String Compare -Codepublic class LeetCode844 { // Backspace String Compare public boolean backspaceCompare(String s, String t) { String sAns = solution(s); String tAns = solution(t); return sAns.equals(tAns); } // 문자열 조건을 통한 생성 private static String solution(String str) { StringBuilder sb = new StringBuilder(); for (int i = 0; i 2026. 7. 12.
[LeetCode/Java] Unique Morse Code Words -Codeimport java.util.HashSet;import java.util.Set;public class LeetCode804 { // Unique Morse Code Words private static final String[] alpaConv = { ".-","-...","-.-.","-..",".","..-.","--.","....","..",".---", "-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-", "..-","...-",".--","-..-","-.--","--.." }; public int uniqueMorseRepresentations(St.. 2026. 7. 11.
[LeetCode/Java] Flood Fill -Codeimport java.util.ArrayDeque;import java.util.Deque;public class LeetCode733 { // Flood Fill static class Position { int row; int col; public Position(int row, int col) { this.row = row; this.col = col; } } // 상하좌우 이동 방향 private static int[] dx = {-1, 1, 0, 0}; private static int[] dy = {0, 0, -1, 1}; public int[][] flood.. 2026. 7. 10.

티스토리툴바