일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | ||
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 |
- 파이썬 릿코드
- python 알고리즘
- binary search
- leetcode풀기
- python xor
- python sorted
- 파이썬 알고리즘 풀기
- 파이썬 프로그래머스
- python priority queue
- leetcode풀이
- 파이썬알고리즘풀기
- 상가수익률계산기
- python zip_longest
- 파이썬릿코드
- 릿코드
- 알고리즘풀기
- 릿코드 파이썬
- 파이썬 알고리즘
- 알고리즘풀이
- 잇츠디모
- 릿코드 풀기
- 릿코드풀기
- LeetCode
- 파이썬알고리즘
- python Leetcode
- leetcode 풀기
- 파이썬릿코드풀기
- 릿코드풀이
- 코틀린기초
- python 릿코드
- Today
- Total
목록전체 글 (273)
소프트웨어에 대한 모든 것

제목 문제) 2325. Decode the Message You are given the strings key and message, which represent a cipher key and a secret message, respectively. The steps to decode message are as follows: Use the first appearance of all 26 lowercase English letters in key as the order of the substitution table. Align the substitution table with the regular English alphabet. Each letter in message is then substituted..

제목 문제) 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree Given two binary trees original and cloned and given a reference to a node target in the original tree. The cloned tree is a copy of the original tree. Return a reference to the same node in the cloned tree. Note that you are not allowed to change any of the two trees or the target node and the answer must be a refer..

제목 문제) 2265. Count Nodes Equal to Average of Subtree Given the root of a binary tree, return the number of nodes where the value of the node is equal to the average of the values in its subtree. Note: The average of n elements is the sum of the n elements divided by n and rounded down to the nearest integer. A subtree of root is a tree consisting of root and all of its descendants. Example 1: In..
제목 문제) 2433. Find The Original Array of Prefix Xor You are given an integer array pref of size n. Find and return the array arr of size n that satisfies: pref[i] = arr[0] ^ arr[1] ^ ... ^ arr[i]. Note that ^ denotes the bitwise-xor operation. It can be proven that the answer is unique. Example 1: Input: pref = [5,2,0,3,1] Output: [5,7,2,3,2] Explanation: From the array [5,7,2,3,2] we have the fo..
문제) 2396. Strictly Palindromic Number An integer n is strictly palindromic if, for every base b between 2 and n - 2 (inclusive), the string representation of the integer n in base b is palindromic. Given an integer n, return true if n is strictly palindromic and false otherwise. A string is palindromic if it reads the same forward and backward. Example 1: Input: n = 9 Output: false Explanation: ..
문제) 1476. Subrectangle Queries Implement the class SubrectangleQueries which receives a rows x cols rectangle as a matrix of integers in the constructor and supports two methods: 1. updateSubrectangle(int row1, int col1, int row2, int col2, int newValue) Updates all values with newValue in the subrectangle whose upper left coordinate is (row1,col1) and bottom right coordinate is (row2,col2). 2. ..
문제) 2465. Number of Distinct Averages You are given a 0-indexed integer array nums of even length. As long as nums is not empty, you must repetitively: Find the minimum number in nums and remove it. Find the maximum number in nums and remove it. Calculate the average of the two removed numbers. The average of two numbers a and b is (a + b) / 2. For example, the average of 2 and 3 is (2 + 3) / 2 ..
문제) 504. Base 7 Given an integer num, return a string of its base 7 representation. Example 1: Input: num = 100 Output: "202" Example 2: Input: num = -7 Output: "-10" Constraints: -107 = 0 else False num = abs(num) while num: num, remainder = divmod(num, 7) base_seven.append(str(remainder)) # 결과 변환 base_seven.reverse() ret = ''.join(base_seven) if not positive: ret = '-' + ret return ret 솔루션2) -..