목록python Leetcode (53)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 1572. Matrix Diagonal Sum

1572. Matrix Diagonal Sum https://leetcode.com/problems/matrix-diagonal-sum/ Matrix Diagonal Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) - Straight forward 왼쪽 상단에서 부터 오른쪽 하단으로 탐색하면서 더합니다. 오른쪽 상단에서 부터 왼쪽 하단으로 탐색하면서 더합니다. 만약 매트릭스가 row가 홀수 크기로 되어 있다면 중간에 원소를 두 번 더했..
알고리즘/LeetCode 2021. 12. 6. 08:19
LeetCode 풀기 - 1290. Convert Binary Number in a Linked List to Integer

1290. Convert Binary Number in a Linked List to Integer https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/ Convert Binary Number in a Linked List to Integer - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) # Definition for singly-linked list..
알고리즘/LeetCode 2021. 12. 4. 15:58
LeetCode 풀기 - 1486. XOR Operation in an Array

1486. XOR Operation in an Array https://leetcode.com/problems/xor-operation-in-an-array/ XOR Operation in an Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) class Solution: def xorOperation(self, n: int, start: int) -> int: res = start for i in range(1, n): res ^=..
알고리즘/LeetCode 2021. 12. 2. 06:22
LeetCode 풀기 - 1329. Sort the Matrix Diagonally

1329. Sort the Matrix Diagonally https://leetcode.com/problems/sort-the-matrix-diagonally/ Sort the Matrix Diagonally - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) - Straight Forward 특별한 자료구조나 알고리즘은 사용하지 않았습니다. 문제 그대로 이해하여 풀었습니다. 문제 풀이 접근: 오른쪽 상단을 시작으로 row++, col++ 이동..
알고리즘/LeetCode 2021. 12. 2. 05:55
LeetCode 풀기 - 654. Maximum Binary Tree

654. Maximum Binary Tree https://leetcode.com/problems/maximum-binary-tree/ Maximum Binary Tree - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) - 재귀 재귀적인 방법으로 왼쪽 서브트리, 오른쪽 서브트리를 구성합니다. 풀이 순서 초기에 루트 노드를 생성 nums에서 max 값과 idx를 탐색 idx 기준으로 왼쪽과 오른쪽으로 나눠서 배열을 나누고 재귀적으로 subtre..
알고리즘/LeetCode 2021. 12. 1. 07:52
LeetCode 풀기 - 1315. Sum of Nodes with Even-Valued Grandparent

1315. Sum of Nodes with Even-Valued Grandparent https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/ Sum of Nodes with Even-Valued Grandparent - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) - stack and tree traversal 이진 트리를 순회합니다. 재귀적 순회 시 부모의 노드를 계..
알고리즘/LeetCode 2021. 11. 24. 20:42
LeetCode 풀기 - 1351. Count Negative Numbers in a Sorted Matrix

1351. Count Negative Numbers in a Sorted Matrix https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/ Count Negative Numbers in a Sorted Matrix - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) - brute force 이중 for 문을 통해서 0보다 작은 number를 셉니다. 시간 복잡도 : O(..
알고리즘/LeetCode 2021. 11. 24. 05:49
LeetCode 풀기 - 1002. Find Common Characters

1002. Find Common Characters https://leetcode.com/problems/find-common-characters/ Find Common Characters - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제) 솔루션1) - brute force 하나의 타겟 단어를 정하고 모든 단어를 비교해 가면서 중복되지 않는 단어를 제거해서 최종적으로 남은 char를 리턴합니다. # brute-force class Solution: def..
알고리즘/LeetCode 2021. 11. 23. 08:28
Prev 1 ··· 3 4 5 6 7 Next