본문 바로가기

IT_적응기
74

[Leetcode] 225. Implement Stack using Queues 큐를 이용한 스택 구현 225. Implement Stack Using Queues https://leetcode.com/problems/implement-stack-using-queues/ Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty). Implement the MyStack class: void push(int x) Pushes element x to the top of the stack. int pop() Removes the element on th.. 2021. 7. 19.
[Leetcode] 206.Reverse Linked List 연결된 리스트 뒤집기 206. Reverse Linked List https://leetcode.com/problems/reverse-linked-list/ 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] Example 2: Input: head = [1,2] Output: [2,1] Example 3: Input: head = [] Output: [] Constraints: The number of nodes in the list is the range [0, 5000]. -5000 ListNo.. 2021. 6. 30.
[Leetcode] 21. Merge Two Sorted Lists 유효한 괄호 21. Merge Two Sorted Lists https://leetcode.com/problems/merge-two-sorted-lists/ Merge two sorted linked lists and return it as a sorted list. The 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] Constrai.. 2021. 6. 28.
[Leetcode] 20. Valid Parentheses 유효한 괄호 20. Valid Parentheses https://leetcode.com/problems/valid-parentheses/ Write a function that reverses a string. The input string is given as an array of characters s. Example 1: Input: s = ["h","e","l","l","o"] Output: ["o","l","l","e","h"] Example 2: Input: s = ["H","a","n","n","a","h"] Output: ["h","a","n","n","a","H"] Constraints: 1 2021. 6. 27.
[Leetcode] 937. Reorder Data in Log Files 로그 파일 재정렬 937. Reorder Data in Log Files https://leetcode.com/problems/reorder-data-in-log-files/ Write a function that reverses a string. The input string is given as an array of characters s. Example 1: Input: s = ["h","e","l","l","o"] Output: ["o","l","l","e","h"] Example 2: Input: s = ["H","a","n","n","a","h"] Output: ["h","a","n","n","a","H"] Constraints: 1 2021. 6. 26.

최근댓글

최근글

티스토리툴바