思路:我还是用的暴力法,什么离散化+线段树等等,看不怎么懂;C++用暴力法直接超时,由于最近在学Go语言,索性用Go测试一波,结果震惊到了:
func countRangeSum(nums []int, lower int, upper int) int {
size := len(nums)
if size == 0 {
return 0
}
res := 0
for i := 0; i < size; i++ {
sum := 0
for j := i; j < size; j++ {
sum += nums[j]
if sum >= lower && sum <= upper {
res++
}
}
}
return res
}