엔지니어 게시판
LeetCode 솔루션 분류

[12/4] 2256. Minimum Average Difference

컨텐츠 정보

본문

Medium
1173143Add to ListShare

You are given a 0-indexed integer array nums of length n.

The average difference of the index i is the absolute difference between the average of the first i + 1 elements of nums and the average of the last n - i - 1 elements. Both averages should be rounded down to the nearest integer.

Return the index with the minimum average difference. If there are multiple such indices, return the smallest one.

Note:

  • The absolute difference of two numbers is the absolute value of their difference.
  • The average of n elements is the sum of the n elements divided (integer division) by n.
  • The average of 0 elements is considered to be 0.

 

Example 1:

Input: nums = [2,5,3,9,5,3]
Output: 3
Explanation:
- The average difference of index 0 is: |2 / 1 - (5 + 3 + 9 + 5 + 3) / 5| = |2 / 1 - 25 / 5| = |2 - 5| = 3.
- The average difference of index 1 is: |(2 + 5) / 2 - (3 + 9 + 5 + 3) / 4| = |7 / 2 - 20 / 4| = |3 - 5| = 2.
- The average difference of index 2 is: |(2 + 5 + 3) / 3 - (9 + 5 + 3) / 3| = |10 / 3 - 17 / 3| = |3 - 5| = 2.
- The average difference of index 3 is: |(2 + 5 + 3 + 9) / 4 - (5 + 3) / 2| = |19 / 4 - 8 / 2| = |4 - 4| = 0.
- The average difference of index 4 is: |(2 + 5 + 3 + 9 + 5) / 5 - 3 / 1| = |24 / 5 - 3 / 1| = |4 - 3| = 1.
- The average difference of index 5 is: |(2 + 5 + 3 + 9 + 5 + 3) / 6 - 0| = |27 / 6 - 0| = |4 - 0| = 4.
The average difference of index 3 is the minimum average difference so return 3.

Example 2:

Input: nums = [0]
Output: 0
Explanation:
The only index is 0 so return 0.
The average difference of index 0 is: |0 / 1 - 0| = |0 - 0| = 0.

 

Constraints:

  • 1 <= nums.length <= 105
  • 0 <= nums[i] <= 105
Accepted
64,494
Submissions
148,473
태그 ,

관련자료

댓글 1

학부유학생님의 댓글

  • 익명
  • 작성일
Runtime: 2905 ms, faster than 22.80% of Python3 online submissions for Minimum Average Difference.
Memory Usage: 25.6 MB, less than 30.55% of Python3 online submissions for Minimum Average Difference.
class Solution:
    def minimumAverageDifference(self, nums: List[int]) -> int:
        preSum = [nums[0]]
        for i in range(1, len(nums)):
            preSum.append(preSum[i-1] + nums[i])
        
        min_diff = float('inf')
        min_idx = 0
        
        for i in range(len(preSum)):
            diff = abs(preSum[i]//(i+1) - (preSum[-1] - preSum[i])//max(len(preSum)-1 -i,1 ) )
            
            if diff < min_diff:
                min_diff = diff
                min_idx = i
            
    
        return min_idx
전체 396 / 2 페이지
번호
제목
이름

최근글


인기글


새댓글


Stats


  • 현재 접속자 149 명
  • 오늘 방문자 1,972 명
  • 어제 방문자 6,462 명
  • 최대 방문자 11,134 명
  • 전체 회원수 1,049 명
알림 0