Algorithm (2) 썸네일형 리스트형 Leetcode 135. Candy 문제 https://leetcode.com/problems/candy/description/ There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.You are giving candies to these children subjected to the following requirements:Each child must have at least one candy.Children with a higher rating get more candies than their neighbors.Return the minimum number of candies you ne.. Leetcode 238. Product of Array Except Self 문제https://leetcode.com/problems/product-of-array-except-self/description Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.You must write an algorithm that runs in O(n) time and without using the division operation.Example 1.. 이전 1 다음