提交 b2e9f9f3 编写于 作者: J jasper 提交者: labuladong

markdown java code

上级 2e799019
......@@ -135,7 +135,7 @@ for (int i = 1; i < count.length; i++)
[labuladong](https://github.com/labuladong) 提供JAVA解法代码:
```
```JAVA
int subarraySum(int[] nums, int k) {
int n = nums.length;
// map:前缀和 -> 该前缀和出现的次数
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册