iOYES iOYES

안녕하세요. 그린입니다🟢 이번 포스팅에서는 오랜만에 알고리즘을 하나 풀어볼까합니다. 이번에는 LeetCode에서 Patching Array라는 문제를 풀어봤어요! 문제제시 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: Com..

아래 문제는 코딜리티에서 제공하는 Passing Cars의 문제입니다🧑🏻‍💻 문제 제시 A non-empty array A consisting of N integers is given. The consecutive elements of array A represent consecutive cars on a road. Array A contains only 0s and/or 1s: - 0 represents a car traveling east - 1 represents a car traveling west. The goal is to count passing cars. We say that a pair of cars (P, Q), where 0 ≤ P < Q < N, is passing when P is..

아래 문제는 코딜리티에서 제공하는 FlogRiverOne의 문제입니다🧑🏻‍💻 문제 제시 A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river. You are given an array A consisting of N integers representing the falling leaves. A[K] represents the position wher..