목록Coding Test/LeetCode (9)

하루의 쉼터

[LeetCode] 9. Palindrome Number

Question : Given an integer x, return true if x is palindrome integer. An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not. Example 1: Input : x = 121 Output : true Example 2: Input : x = -121 Output : false Explanation : From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome. Exa..
Coding Test/LeetCode 2021. 10. 7. 15:56
[LeetCode] 7. Reverse Integer

Question : Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0. * Assume the environment does not allow you to store 64-bit integers (signed or unsigned). Example 1: Input: x = 123 Output: 321 Example 2: Example 2: Input: x = -123 Output: -321 Example 3: Example 3: Input: ..
Coding Test/LeetCode 2021. 10. 5. 09:16
[LeetCode] 206. Reverse Linked List

Question : Reverse a singly linked list. Exapmle : Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both? Solution.h #include #include #include struct ListNode { int val; ListNode* next; ListNode() : val(0), next(nullptr) {} ListNode(int x) : val(x), next(nullptr) {} ListNode(int x, ListNode* ne..
Coding Test/LeetCode 2020. 12. 6. 22:07
[LeetCode] 53. Maximum Subarray

Question : Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Follow up: If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6...
Coding Test/LeetCode 2020. 11. 30. 23:18
[LeetCode] 21. Merge Two Sorted Lists

Question : Merge two sorted linked lists and return it as a new sorted list. The new list should be made by splicing together the nodes of the first two lists. Example 1 : Input: l1 = [1,2,4], l2 = [1,3,4] Output: [1,1,2,3,4,4] Example 2 : Input: l1 = [], l2 = [] Output: [] Example 3 : Input: l1 = [], l2 = [0] Output: [0] Constraints : The number of nodes in both lists is in the range [0, 50] -1..
Coding Test/LeetCode 2020. 11. 24. 07:00
[LeetCode] 136. Single Number

Question Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. Follow up: Could you implement a solution with a linear runtime complexity and without using extra memory? Example 1: Input: nums = [2,2,1] Output: 1 Example 2: Input: nums = [4,1,2,1,2] Output: 4 Example 3: Input: nums = [1] Output: 1 Constraints: 1
Coding Test/LeetCode 2020. 11. 23. 02:03
[LeetCode] 20. Valid Parentheses

Question : Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. Example 1:Input: s = "()"Output: true Example 2:Input: s = "()[]{}"Output: true Example 3:Input: s = "(]"Output: false Example ..
Coding Test/LeetCode 2020. 11. 17. 02:12
[LeetCode] 1. Two Sum

Question : Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. Input: 38 Output: 2 Explanation: The process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.Question Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would hav..
Coding Test/LeetCode 2020. 11. 17. 02:02
Prev 1 2 Next