lkdcode

lkdcode


public class Hello {
    public void print() {
        System.out.println("Hi");
    }
}

# Language

# Framework

Spring Security

Spring Security

# Data

# Infra

# Etc

Java

제네릭과 공변성

제네릭과 공변성

컴파일러와의 싸움(?)

오토박싱/언박싱 성능 체크 (JMH)

오토박싱/언박싱 성능 체크 (JMH)

오토 박싱/언박싱에 대해 JMH 로 성능을 체크해보자

var 키워드

타입 추론 var 의 가독성 (feat.FQN)

final 키워드

final 키워드

재할당 금지와 마커 효과

커스텀 DSL

한 번 쓰인 코드는 여러 번 읽힌다. 도메인 전용 언어로 표현할 수 있다.

동작 파라미터화 2

동작 파라미터화 2

함수형 인터페이스, 람다표현식, 메서드 참조 등

동작 파라미터화1

동작 파라미터화1

행위를 추상화하면 변경에 대처하기 쉬우며 가독성을 높일 수 있다.

Algorithm

BFS, 너비 우선 탐색!

BFS, 너비 우선 탐색!

[Programmers] 크레인 인형뽑기 게임

[Programmers] 크레인 인형뽑기 게임

[Programmers] 체육복

[Programmers] 체육복

[Programmers] [1차] 다트 게임

[Programmers] [1차] 다트 게임

[Programmers] 옹알이 (1)

[Programmers] 옹알이 (1)

백준] 10986 나머지 합

백준] 10986 나머지 합

[백준] 18110 solved.ac

[백준] 18110 solved.ac

[백준] 20529 가장 가까운 세 사람의 심리적 거리

[백준] 20529 가장 가까운 세 사람의 심리적 거리

[백준] 16928 뱀과 사다리 게임

[백준] 16928 뱀과 사다리 게임

[백준] 1107 리모컨

[백준] 1107 리모컨

[백준] 9019 DSLR

[백준] 9019 DSLR

[LeetCode] 909. Snakes and Ladders

[LeetCode] 909. Snakes and Ladders

[LeetCode] 373. Find K Pairs with Smallest Sums

[LeetCode] 373. Find K Pairs with Smallest Sums

LeetCode] 212. Word Search II

LeetCode] 212. Word Search II

[LeetCode] 215. Kth Largest Element in an Array

[LeetCode] 215. Kth Largest Element in an Array

[LeetCode] 211. Design Add and Search Words Data Structure

[LeetCode] 211. Design Add and Search Words Data Structure

[LeetCode] 208. Implement Trie (Prefix Tree)

[LeetCode] 208. Implement Trie (Prefix Tree)

[LeetCode] 637. Average of Levels in Binary Tree

[LeetCode] 637. Average of Levels in Binary Tree

[LeetCode] 199. Binary Tree Right Side View

[LeetCode] 199. Binary Tree Right Side View

[LeetCode] 230. Kth Smallest Element in a BST

[LeetCode] 230. Kth Smallest Element in a BST

[LeetCode] 530. Minimum Absolute Difference in BST

[LeetCode] 530. Minimum Absolute Difference in BST

[LeetCode] 33. Search in Rotated Sorted Array

[LeetCode] 33. Search in Rotated Sorted Array

[LeetCode] 153. Find Minimum in Rotated Sorted Array

[LeetCode] 153. Find Minimum in Rotated Sorted Array

[LeetCode] 162. Find Peak Element

[LeetCode] 162. Find Peak Element

[LeetCode] 242. Valid Anagram

[LeetCode] 242. Valid Anagram

[LeetCode] 383. Ransom Note

[LeetCode] 383. Ransom Note

[LeetCode] 219. Contains Duplicate II

[LeetCode] 219. Contains Duplicate II

[LeetCode] 1. Two Sum

[LeetCode] 1. Two Sum

[LeetCode] 150. Evaluate Reverse Polish Notation

[LeetCode] 150. Evaluate Reverse Polish Notation

[LeetCode] 155. Min Stack

[LeetCode] 155. Min Stack

[LeetCode] 2. Add Two Numbers

[LeetCode] 2. Add Two Numbers

[LeetCode] 141. Linked List Cycle

[LeetCode] 141. Linked List Cycle

[LeetCode] 74. Search a 2D Matrix

[LeetCode] 74. Search a 2D Matrix

[LeetCode] 3. Longest Substring Without Repeating Characters

[LeetCode] 3. Longest Substring Without Repeating Characters

[LeetCode] 209. Minimum Size Subarray Sum

[LeetCode] 209. Minimum Size Subarray Sum

[LeetCode] 125. Valid Palindrome

[LeetCode] 125. Valid Palindrome

[LeetCode] 167. Two Sum II - Input Array Is Sorted

[LeetCode] 167. Two Sum II - Input Array Is Sorted

[LeetCode] 80. Remove Duplicates from Sorted Array II

[LeetCode] 80. Remove Duplicates from Sorted Array II

[LeetCode] 88. Merge Sorted Array

[LeetCode] 88. Merge Sorted Array

[LeetCode] 27. Remove Element

[LeetCode] 27. Remove Element

[LeetCode] 26. Remove Duplicates from Sorted Array

[LeetCode] 26. Remove Duplicates from Sorted Array

[LeetCode] 169. Majority Element

[LeetCode] 169. Majority Element

[LeetCode] 189. Rotate Array

[LeetCode] 189. Rotate Array

[LeetCode] 121. Best Time to Buy and Sell Stock

[LeetCode] 121. Best Time to Buy and Sell Stock

[LeetCode] 122. Best Time to Buy and Sell Stock II

[LeetCode] 122. Best Time to Buy and Sell Stock II

[백준] 1260 DFS와 BFS - Java

[백준] 1260 DFS와 BFS - Java