2017年5月4日
[LeetCode] 560. Subarray Sum Equals K 子数组和为K
摘要： Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Input:nums = 阅读全文
posted @ 2017-05-04 22:46 Grandyang 阅读(26213) 评论(9) 推荐(1)
Fork me on GitHub