Jaime's 기술 블로그

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an m x n matrix, return all elements of the matrix in spiral order. Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,2,3,6,9,8,7,4,5] Example 2: Input: matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]] Output: [1,2,3,4,8,12,11,10,9,5,6,7] Constraints: m == matrix.length n == matrix[i].length 1

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer array arr, return the length of a maximum size turbulent subarray of arr. A subarray is turbulent if the comparison sign flips between each adjacent pair of elements in the subarray. More formally, a subarray [arr[i], arr[i + 1], ..., arr[j]] of arr is said to be turbulent if and only if: For i arr[k + 1] when k is odd, and arr[k] < arr[k + 1..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a string s, reverse the string according to the following rules: All the characters that are not English letters remain in the same position. All the English letters (lowercase or uppercase) should be reversed. Return s after reversing it. Example 1: Input: s = "ab-cd" Output: "dc-ba"Example 2: Input: s = "a-bC-dEf-ghIj" Output: "j-Ih-gfE-dCba"Example 3..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible. You can use each character in text at most once. Return the maximum number of instances that can be formed. Example 1: Input: text = "nlaebolko" Output: 1 Example 2: Input: text = "loonbalxballpoon" Output: 2 Example 3: Input: text = "leetc..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an integer n. You have an n x n binary grid grid with all values initially 1&#39;s except for some indices given in the array mines. The ith element of the array mines is defined as mines[i] = [xi, yi] where grid[xi][yi] == 0. Return the order of the largest axis-aligned plus sign of 1&#39;s contained in grid. If there is none, return 0. An axis..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given a string s of lowercase English letters and an integer array shifts of the same length. Call the shift() of a letter, the next letter in the alphabet, (wrapping around so that &#39;z&#39; becomes &#39;a&#39;). For example, shift(&#39;a&#39;) = &#39;b&#39;, shift(&#39;t&#39;) = &#39;u&#39;, and shift(&#39;z&#39;) = &#39;a&#39;. Now for each shift..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem 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

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem A newly designed keypad was tested, where a tester pressed a sequence of n keys, one at a time. You are given a string keysPressed of length n, where keysPressed[i] was the ith key pressed in the testing sequence, and a sorted list releaseTimes, where releaseTimes[i] was the time the ith key was released. Both arrays are 0-indexed. The 0th key was pressed at ..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n. Example 1: 1 1 2 3 3 \ \ / \ / / 3 2 1 3 2 1 / \ / \ 2 3 1 2 Input: n = 3 Output: 5 Example 2: Input: n = 1 Output: 1 Constraints: 1

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an integer array nums of length n where nums is a permutation of the numbers in the range [0, n - 1]. You should build a set s[k] = {nums[k], nums[nums[k]], nums[nums[nums[k]]], ... } subjected to the following rule: The first element in s[k] starts with the selection of the element nums[k] of index = k. The next element in s[k] should be nums[n..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [4,5,6,7,0,1,2] if it was rotated 4 times. [0,1,2,4,5,6,7] if it was rotated 7 times. Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an m x n matrix M initialized with all 0&#39;s and an array of operations ops, where ops[i] = [ai, bi] means M[x][y] should be incremented by one for all 0

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a sorted integer array nums and an integer n, add/patch elements to the array such that any number in the range [1, n] inclusive can be formed by the sum of some elements in the array. Return the minimum number of patches required. Example 1: Input: nums = [1,3], n = 6 Output: 1 Explanation: Combinations of nums are [1], [3], [1,3], which form possible ..

Problem One way to serialize a binary tree is to use preorder traversal. When we encounter a non-null node, we record the node&#39;s value. If it is a null node, we record using a sentinel value such as &#39;#&#39;. For example, the above binary tree can be serialized to the string "9,3,4,#,#,1,#,#,2,#,6,#,#", where &#39;#&#39; represents a null node. Given a string of comma-separated values pre..

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a non-negative integer c, decide whether there are two integers a and b such that a^2 + b^2 = c. Example 1: Input: c = 5 Output: true Explanation: 1 * 1 + 2 * 2 = 5 Example 2: Input: c = 3 Output: false Example 3: Input: c = 4 Output: true Example 4: Input: c = 2 Output: true Example 5: Input: c = 1 Output: true Constraints: 0 test(14, false) ); } priva..