澈彻策的博客

LeetCode 402. Remove K Digits

675. Cut Off Trees for Golf EventYou are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map:0 represents the obstacle can'

494. Target SumYou are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its ne

Leetcode 547. Friend Circles JAVA实现 深度优先遍历

1.题目题意简而言之就是求一颗二叉树的每一层最大节点，并用集合的形式将其返回。2.思路我的想法比较愚笨，是将此二叉树中的每一个节点标记上其所在的层数，然后在按层次标记遍历所有节点得出每一层的最大节点。其中做层次标记的时候与找最大节点时候都是用的层次遍历。3.代码 class TreeNode { int val; TreeNode left;

LeetCode 410. Split Array Largest Sum 动态规划 最小m段和问题

LeetCode 第394题 Decode String 的JAVA实现

LeetCode 第224题 Basic Calculator JAVA语言实现

198. House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of th