feat(translation): #364 translate problem 560

[suukii]

No description provided.

[azl397985856]

Suggested change

	The simplest method is to use brute force. Consider every possible subarray, find the sum of the elements of each of those subarrays and check for the equality of the sum with `k`. Whenever the sum equals `k`, we increment the `count`. Time Complexity is O(n^2). Implementaion is as followed.
	The simplest method is `Brute-force`. Consider every possible subarray, find the sum of the elements of each of those subarrays and check for the equality of the sum with `k`. Whenever the sum equals `k`, we increment the `count`. Time Complexity is O(n^2). Implementation is as followed.

[azl397985856]

Suggested change

	If we implement the `sum()` method on our own, we get the time complexity O(n^3).
	If we implement the `sum()` method on our own, we get the time complexity of O(n^3).

[azl397985856]

Suggested change

	- We traverse over the given array and keep on finding the cumulative sum `acc`. Every time we ecounter a new `acc` we add a new entry to the hashmap. If the same `acc` occurs, we increment the count corresponding to that `acc` in the hashmap. If `acc` equals `k`, obviously `count` should be incremented. If `acc - k` has occured, we should increment `account` by `hashmap[acc - k]`.
	- We traverse over the given array and keep on finding the cumulative sum `acc`. Every time encounter a new `acc` we add a new entry to the hashmap. If the same `acc` occurs, we increment the count corresponding to that `acc` in the hashmap. If `acc` equals `k`, obviously `count` should be incremented. If `acc - k` got, we should increment `account` by `hashmap[acc - k]`.

[azl397985856]

Suggested change

	There is a similar but a bit more complicated problem. Link to the problem: [437.path-sum-iii](https://github.com/azl397985856/leetcode/blob/master/problems/437.path-sum-iii.md).
	There is a similar but a bit more complicated problem. Link to the problem: [437.path-sum-iii](https://github.com/azl397985856/leetcode/blob/master/problems/437.path-sum-iii.md)(Chinese).