Window Sum
来源:互联网 发布:windows rt 升级 编辑:程序博客网 时间:2024/06/07 01:58
Given an array of n integer, and a moving window(size k), move the window at each iteration from the start of the array, find the sum
of the element inside the window at each moving.
Example
python
For array [1,2,7,8,5]
, moving window size k = 3
.
1 + 2 + 7 = 10
2 + 7 + 8 = 17
7 + 8 + 5 = 20
return [10,17,20]
java
public class Solution { /* * @param nums: a list of integers. * @param k: length of window. * @return: the sum of the element inside the window at each moving. */ public int[] winSum(int[] nums, int k) { // write your code here if (nums == null || nums.length == 0) { return nums; } if (nums.length < k) { return null; } int[] temp = new int[nums.length + 1]; temp[0] = 0; int sum = 0; for (int i = 0; i < nums.length; i++) { sum += nums[i]; temp[i + 1] = sum; } int[] result = new int[nums.length - k + 1]; for (int i = k; i < temp.length; i++) { result[i - k] = temp[i] - temp[i - k]; } return result; }}
python
class Solution: """ @param: nums: a list of integers. @param: k: length of window. @return: the sum of the element inside the window at each moving. """ def winSum(self, nums, k): # write your code here if nums is None or len(nums) == 0 or k <= 0: return nums if len(nums) < k: return None result = [0] * (len(nums) - k + 1) for i in range(k): result[0] += nums[i] for i in range(1, len(nums) - k + 1): result[i] = result[i - 1] - nums[i - 1] + nums[i + k - 1] return result
阅读全文
0 0
- Window sum
- Window Sum
- leetcode 76 Minimum Window Substring/ 209 Minimum Size Subarray Sum
- LINTCODE——Sliding Window Unique Elements Sum
- Window
- window
- window
- window
- window
- window
- window
- Window
- window
- Window
- ‘Window’
- Window
- lintcode---滑动窗口内唯一元素数量和 (Sliding Window Unique Elements Sum)
- Sum
- 开启博客记录之旅
- 小鲜鹅的运营经:“地有多大产,心有多大胆”。
- 基于 Erlang/OTP 搭建TCP服务器
- JAVA线程知识整理
- fork(),vfork(),clone()的区别
- Window Sum
- [monitor] 6. Linux kdump(系统临终快照)
- [App] FTP 虚拟用户搭建服务器
- 使用form提交后返回值处理
- Oracle的完整练习
- Swift4 'substring(to:)' is deprecated: Please use String slicing subscript with a 'partial range upt
- hibernate乐观锁
- HDU 2700 Parity(找规律)
- 中文乱码问题