Leetcode Daily Question

Leetcode-cn.com 2022-04-04
🟡 307.range-sum-query-mutable

🏷️ Tags
#design #binary_indexed_tree #segment_tree #array

Description
给你一个数组 nums ，请你完成两类查询。

其中一类查询要求更新数组 nums 下标对应的值
另一类查询要求返回数组 nums 中索引 left 和索引 right 之间（包含）的nums元素的和，其中 left <= right

实现 NumArray 类：

NumArray(int[] nums) 用整数数组 nums 初始化对象
void update(int index, int val) 将 nums[index] 的值更新为 val
int sumRange(int left, int right) 返回数组 nums 中索引 left 和索引 right 之间（包含）的nums元素的和（即，nums[left] + nums[left + 1], ..., nums[right]）

Example

输入：
["NumArray", "sumRange", "update", "sumRange"]
[[[1, 3, 5]], [0, 2], [1, 2], [0, 2]]
输出：
[null, 9, null, 8]

解释：
NumArray numArray = new NumArray([1, 3, 5]);
numArray.sumRange(0, 2); // 返回 1 + 3 + 5 = 9
numArray.update(1, 2);   // nums = [1,2,5]
numArray.sumRange(0, 2); // 返回 1 + 2 + 5 = 8

198 views16:30

CN CN Solution

Leetcode Daily Question

307.range-sum-query-mutable.pdf

63 KB

leetcode.com 2022-07-31
🟡307.range-sum-query-mutable

🏷️ Tags
#array #design #binary_indexed_tree #segment_tree

295 views16:09

Source Solution

Leetcode Daily Question

218.the-skyline-problem.pdf

210.7 KB

leetcode.com 2022-09-30
🔴218.the-skyline-problem

🏷️ Tags
#array #divide_and_conquer #binary_indexed_tree #segment_tree #line_sweep #heap_priority_queue #ordered_set

233 views16:09

Source Solution

Leetcode Daily Question

leetcode.cn 2023-04-16
🔴1157.online-majority-element-in-subarray

🏷️ Tags
#design #binary_indexed_tree #segment_tree #array #binary_search

Telegraph

online-majority-element-in-subarray

设计一个数据结构，有效地找到给定子数组的多数元素。子数组的多数元素是在子数组中出现 threshold 次数或次数以上的元素。实现 MajorityChecker 类:

175 views16:11

来源答案

Leetcode Daily Question

leetcode.com 2023-05-07
🔴1964.find-the-longest-valid-obstacle-course-at-each-position

🏷️ Tags
#binary_indexed_tree #array #binary_search

Telegraph

find-the-longest-valid-obstacle-course-at-each-position

You want to build some obstacle courses. You are given a 0-indexed integer array obstacles of length n, where obstacles[i] describes the height of the ith obstacle. For every index i between 0 and n - 1 (inclusive), find the length of the longest obstacle…

137 views00:11

Source Solution

Leetcode Daily Question

leetcode.com 2023-07-21
🟡673.number-of-longest-increasing-subsequence

🏷️ Tags
#binary_indexed_tree #segment_tree #array #dynamic_programming

Telegraph

number-of-longest-increasing-subsequence

Given an integer array nums, return the number of longest increasing subsequences. Notice that the sequence has to be strictly increasing. Example 1: Input: nums = [1,3,5,4,7] Output: 2 Explanation: The two longest increasing subsequences are [1, 3, 4,…

146 views00:10

Source Solution