[LeetCode] 91. Decode Ways - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/decode-ways/description/ Decode Ways - 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 문제 A message containing letters from A-Z can be encoded into numbers using the following mapping: 'A' -> "1" 'B' -> "2" ... 'Z' -> "26" To decode an encoded message,..
[LeetCode] 21. Merge Two Sorted Lists - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/merge-two-sorted-lists/description/ Merge Two Sorted Lists - 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 문제 You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by spl..
[LeetCode] 141. Linked List Cycle - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/linked-list-cycle/description/ Linked List Cycle - 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 문제 Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the ..
[LeetCode] 206. Reverse Linked List - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/reverse-linked-list/description/ Reverse Linked List - 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 문제 Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] E..
[LeetCode] 226. Invert Binary Tree - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/invert-binary-tree/description/ Invert Binary Tree - 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 문제 Given the root of a binary tree, invert the tree, and return its root. Example 1: Input: root = [4,2,7,1,3,6,9] Output: [4,7,2,9,6,3,1] Example 2: I..
HYOJUN
'자바' 태그의 글 목록 (12 Page)