摘要: You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t 阅读全文
posted @ 2018-10-15 17:14 Pickle 阅读(150) 评论(0) 推荐(0) 编辑
摘要: 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: Note: 解法一:利用s 阅读全文
posted @ 2018-10-15 16:32 Pickle 阅读(220) 评论(0) 推荐(0) 编辑