2021年8月30日
[LeetCode] 1984. Minimum Difference Between Highest and Lowest of K Scores
摘要： You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k. Pick the scores 阅读全文
posted @ 2021-08-30 23:55 CNoodle 阅读(261) 评论(0) 推荐(0)
[LeetCode] 1588. Sum of All Odd Length Subarrays
摘要： Given an array of positive integers arr, calculate the sum of all possible odd-length subarrays. A subarray is a contiguous subsequence of the array. 阅读全文
posted @ 2021-08-30 16:15 CNoodle 阅读(367) 评论(0) 推荐(0)