Feb 27, 2020 06:27:11 AM
Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K.
Example 1:
Input: A = [4,5,0,-2,-3,1], K = 5
Output: 7
Explanation: There are 7 subarrays with a sum divisible by K = 5:
[4, 5, 0, -2, -3, 1], [5], [5, 0], [5, 0, -2, -3], [0], [0, -2, -3], [-2, -3]
Note:
-
1 <= A.length <= 30000
-
-10000 <= A[i] <= 10000
-
2 <= K <= 10000
Tags: Algorithm 算法 array Golang ruby
Posted in 算法 | 1 Comments
Nov 06, 2015 02:42:44 PM
I learned libgit2/rugged when I involved in a project which is to analysis a repository. I found it's a little hard to use Rugged to do the basic things, e.g. `git pull`, `git push`, etc. This is the purpose that I want to add some notes here. In case of someday there's someone likes me who encounter into these kinds of stuff. ლ(╹◡╹ლ)
Tags: ruby Rugged
Posted in 笔记 | 1 Comments
