iOYES iOYES

아래 문제는 코딜리티에서 제공하는 Sorting > Triangle의 문제입니다🧑🏻‍💻 문제 제시 더보기 An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P A[R], A[Q] + A[R] > A[P], A[R] + A[P] > A[Q]. For example, consider array A such that: A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20 Triplet (0, 2, 4) is triangular. Write a function: public func solution(_ A ..

아래 문제는 코딜리티에서 제공하는 Sorting > MaxProductOfThree의 문제입니다🧑🏻‍💻 문제 제시 더보기 A non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N). For example, array A such that: A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A[4] = 5 A[5] = 6 contains the following example triplets: (0, 1, 2), product is −3 * 1 * 2 = −6 (1, 2, 4), product is 1 ..

요즘 알고리즘을 도통 안한것 같아서.. 사실 할 필요성을 크게 못느끼고 있었던것도 있다😱 그래서 알고리즘 학습이나 문제 풀이를 예전보다 낮은 비중으로 두기로 하였지만 주말에는 딥한거 하기가 싫어서 정말 간단하게 쉬운걸로 머리를 깨우려고 심심해서 풀어보는 문제! 아래 문제는 코딜리티에서 제공하는 Sorting > distinct의 문제입니다🧑🏻‍💻 문제 제시 Write a function public func solution(_ A : inout [Int]) -> Int that, given an array A consisting of N integers, returns the number of distinct values in array A. For example, given array A consist..

아래 문제는 코딜리티에서 제공하는 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..

아래 문제는 코딜리티에서 제공하는 MissingInteger의 문제입니다🧑🏻‍💻 문제 제시 This is a demo task. Write a function: public func solution(_ A : inout [Int]) -> Int that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3]..

아래 문제는 코딜리티에서 제공하는 MaxCounters의 문제입니다🧑🏻‍💻 문제 제시 You are given N counters, initially set to 0, and you have two possible operations on them: increase(X) − counter X is increased by 1, max counter − all counters are set to the maximum value of any counter. A non-empty array A of M integers is given. This array represents consecutive operations: if A[K] = X, such that 1 ≤ X ≤ N, then operation K 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..

아래 문제는 코딜리티에서 제공하는 TapeEquilibrium의 문제입니다🧑🏻‍💻 문제 제시 A non-empty array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1]. The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + ..