작심삼일

문제 링크: https://leetcode.com/problems/score-of-parentheses/ 문제 Given a balanced parentheses string s, return the score of the string. The score of a balanced parentheses string is based on the following rule: "()" has score 1. AB has score A + B, where A and B are balanced parentheses strings. (A) has score 2 * A, where A is a balanced parentheses string. 조건 2

문제 링크: https://leetcode.com/problems/validate-stack-sequences/ 문제 Given two integer arrays pushed and popped each with distinct values, return true if this could have been the result of a sequence of push and pop operations on an initially empty stack, or false otherwise. 조건 1

문제 링크: https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/ 문제 Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string. Formally, a parentheses string is valid if and only if: It is the empty string, con..

문제 링크: https://leetcode.com/problems/simplify-path/ 문제 Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path. In a Unix-style file system, a period '.' refers to the current directory, a double period '..' refers to the directory up a level, and any multiple consecutive slashes (i..

문제 링크: https://leetcode.com/problems/rotate-list/ 문제 Given the head of a linked list, rotate the list to the right by k places. 조건 The number of nodes in the list is in the range [0, 500]. -100

문제 링크: https://leetcode.com/problems/add-two-numbers/ 문제 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. 조건 The number of nodes..

문제 링크: https://leetcode.com/problems/linked-list-cycle/ 문제 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 list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is..

문제 링크: https://leetcode.com/problems/merge-two-sorted-lists/ 문제 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 splicing together the nodes of the first two lists. Return the head of the merged linked list. 조건 The number of nodes in both lists is in the range [0, 50]. -100