본문 바로가기

Algorithm

 (2139)
(C++, Rust) - LeetCode (easy) 222. Count Complete Tree Nodes https://leetcode.com/problems/fair-candy-swap/description/ Fair Candy Swap - LeetCode Can you solve this real interview question? Fair Candy Swap - Alice and Bob have a different total number of candies. You are given two integer arrays aliceSizes and bobSizes where aliceSizes[i] is the number of candies of the ith box of candy that Alice h leetcode.com 이분탐색 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. alice 가 ..
(C++) - LeetCode (easy) 222. Count Complete Tree Nodes https://leetcode.com/problems/count-complete-tree-nodes/description/ Count Complete Tree Nodes - LeetCode Can you solve this real interview question? Count Complete Tree Nodes - Given the root of a complete binary tree, return the number of the nodes in the tree. According to Wikipedia [http://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees], every lev leetcode.com 재귀를 이용한 tree 순회 문제였습니다..
(C++) - LeetCode (easy) 884. Uncommon Words from Two Sentences https://leetcode.com/problems/uncommon-words-from-two-sentences/description/ Uncommon Words from Two Sentences - LeetCode Can you solve this real interview question? Uncommon Words from Two Sentences - A sentence is a string of single-space separated words where each word consists only of lowercase letters. A word is uncommon if it appears exactly once in one of the sentences leetcode.com 자료구조를 ..
(C++) - LeetCode (easy) 696. Count Binary Substrings https://leetcode.com/problems/count-binary-substrings/description/ Count Binary Substrings - LeetCode Can you solve this real interview question? Count Binary Substrings - Given a binary string s, return the number of non-empty substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초..
(C++) - LeetCode (easy) 883. Projection Area of 3D Shapes https://leetcode.com/problems/projection-area-of-3d-shapes/ Projection Area of 3D Shapes - LeetCode Can you solve this real interview question? Projection Area of 3D Shapes - You are given an n x n grid where we place some 1 x 1 x 1 cubes that are axis-aligned with the x, y, and z axes. Each value v = grid[i][j] represents a tower of v cubes placed on to leetcode.com 공식을 찾아내 구현한 문제였습니다. 📕 풀이방법 📔..
(C++) - LeetCode (easy) 872. Leaf-Similar Trees https://leetcode.com/problems/middle-of-the-linked-list/description/ Middle of the Linked List - LeetCode Can you solve this real interview question? Middle of the Linked List - Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. Example 1: [https://assets.leetcode. leetcode.com 자료구조에 대한 이해를 토대로 구현한 문제였습..
(C++) - LeetCode (easy) 872. Leaf-Similar Trees https://leetcode.com/problems/leaf-similar-trees/description/ Leaf-Similar Trees - LeetCode Can you solve this real interview question? Leaf-Similar Trees - Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence. [https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/16/tree.png leetcode.com tree순회를 구현하는 문제였습니다. 📕 풀이방법 📔 입력 및 초기화..
(C++) - LeetCode (easy) 868. Binary Gap https://leetcode.com/problems/binary-gap/description/ Binary Gap - LeetCode Can you solve this real interview question? Binary Gap - Given a positive integer n, find and return the longest distance between any two adjacent 1's in the binary representation of n. If there are no two adjacent 1's, return 0. Two 1's are adjacent if th leetcode.com 이진법 변환 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 이진법으로 변환해 문자열..

티스토리툴바