GoLang Solution For LeetCode Problem: Count of Range Sum
Solving Count of Range Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: nums = [-2,5,-1], lower = -2, upper = 2, Output: 3 Explanation: The three ranges are : [0,0], [2,2], [0,2] and their respective sums are: -2, -1, 2. !(https://img.halfrost.com/Leetcode/leetcode_327_0.png) !(https://img.halfrost.com/Leetcode/leetcode_327_1.png) !(https://img.halfrost.com/Leetcode/leetcode_327_2_.png) !(https://img.halfrost.com/Leetcode/leetcode_327_3_.png) !(https://img.halfrost.com/Leetcode/leetcode_327_4_.png) !(https://img.halfrost.com/Leetcode/leetcode_327_5_.png) !(https://img.halfrost.com/Leetcode/leetcode_327_6_.png) !(https://img.halfrost.com/Leetcode/leetcode_327_7_.png) !(https://img.halfrost.com/Leetcode/leetcode_327_8_.png)
See the full details of the problem Count of Range Sum at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go