[leetcode]Count of Range Sum
2016-11-11 17:05
363 查看
题意:给定一个数组,判断连续子数组的和在某个区间的个数
首先用sum数组存储前n个的和。然后有两种方法
方法一:二叉搜索树。把前面的数组元素放到二叉搜索树上,然后中序遍历,如果该元素-某个元素小于下边界直接返回
方法二:线段树。非叶子节点代表范围内的节点个数。从后往前更新即可。
第二种的代码在:http://blog.csdn.net/murmured/article/details/50495085上有,我觉得用指针做线段树挺好的。
首先用sum数组存储前n个的和。然后有两种方法
方法一:二叉搜索树。把前面的数组元素放到二叉搜索树上,然后中序遍历,如果该元素-某个元素小于下边界直接返回
方法二:线段树。非叶子节点代表范围内的节点个数。从后往前更新即可。
第二种的代码在:http://blog.csdn.net/murmured/article/details/50495085上有,我觉得用指针做线段树挺好的。
相关文章推荐
- Leetcode327——Count of Range Sum
- LeetCode Count of Range Sum
- Leetcode Count of Range Sum
- LeetCode-Count of Range Sum
- [LeetCode 327] Count of Range Sum
- LeetCode Count of Range Sum
- Leetcode Count of Range Sum
- [LeetCode] Count of Range Sum 区间和计数
- Count of Range Sum(leetcode)
- LeetCode 327 Count of Range Sum
- [LeetCode]Count of Range Sum
- [LeetCode] Count of Range Sum
- leetcode_c++:Divide and Conquer:Count of Range Sum(327)
- [leetcode-327]Count of Range Sum(java)
- LeetCode 327 Count of Range Sum(分治)
- LeetCode "Count of Range Sum" !!
- leetcode Count of Range Sum
- []LeetCode]Count of Range Sum
- 2017-09-14 LeetCode_327 Count of Range Sum
- leetcode@ [327] Count of Range Sum (Binary Search)