Xenonon的博客

https://leetcode-cn.com/problems/subarray-sum-equals-k/solution/he-wei-kde-zi-shu-zu-by-leetcode-solution/方法一：class Solution { public int subarraySum(int[] nums, int k) { int count = 0, pre = 0; HashMap <Integer, Integer> mp =.

https://leetcode-cn.com/problems/single-number/solution/xue-suan-fa-jie-guo-xiang-dui-yu-guo-cheng-bu-na-y/方法一：哈希表class Solution { public int singleNumber(int[] nums) { Map<Integer, Integer> map = new HashMap<>(); for (I.

https://leetcode-cn.com/problems/binary-tree-level-order-traversal/solution/tao-mo-ban-bfs-he-dfs-du-ke-yi-jie-jue-by-fuxuemin/方法一：DFS/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * Tree.

https://leetcode-cn.com/problems/min-stack/solution/shi-yong-fu-zhu-zhan-tong-bu-he-bu-tong-bu-python-/方法一：辅助栈和数据栈同步import java.util.Stack;class MinStack { private Stack<Integer> data; private Stack<Integer> helper; /** initial.

https://leetcode-cn.com/problems/powx-n/solution/powx-n-by-leetcode-solution/方法一：递归Pythonclass Solution: def myPow(self, x: float, n: int) -> float: def quickMul(N): if N == 0: return 1.0 y = quic.

https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree/solution/er-cha-shu-de-zui-jin-gong-gong-zu-xian-by-leetc-2/方法一：递归/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * .

https://leetcode-cn.com/problems/subtree-of-another-tree/solution/xiong-mao-shua-ti-python3-di-gui-pan-duan-liang-ke/# Definition for a binary tree node.# class TreeNode:# def __init__(self, ...

https://leetcode-cn.com/problems/minimum-cost-for-tickets/solution/zui-di-piao-jie-by-leetcode-solution/方法一：class Solution { int[] costs; Integer[] memo; Set<Integer> dayset; ...

https://leetcode-cn.com/problems/validate-binary-search-tree/solution/yan-zheng-er-cha-sou-suo-shu-by-leetcode-solution/方法一：中序遍历/** * Definition for a binary tree node. * public class TreeNode {...

https://leetcode-cn.com/problems/validate-binary-search-tree/solution/zhong-xu-bian-li-qing-song-na-xia-bi-xu-miao-dong-/方法一：递归# Definition for a binary tree node.# class TreeNode:# def __in...

https://leetcode-cn.com/problems/jump-game-ii/solution/tiao-yue-you-xi-ii-by-leetcode-solution/方法一：贪心class Solution { public int jump(int[] nums) { int position = nums.length - 1; ...

https://leetcode-cn.com/problems/maximum-subarray/solution/bao-li-qiu-jie-by-pandawakaka/方法一：贪心class Solution { public int maxSubArray(int[] nums) { int cur = 0; int res = nums...

方法一：class Solution: def lengthOfLongestSubstring(self, s: str) -> int: occ = set() n = len(s) rk, ans = -1, 0 for i in range(n): if i != 0: ...

https://leetcode-cn.com/problems/merge-two-sorted-lists/solution/he-bing-liang-ge-you-xu-lian-biao-by-leetcode-solu/方法一：迭代# Definition for singly-linked list.# class ListNode:# def __init__(...

https://leetcode-cn.com/problems/happy-number/solution/kuai-le-shu-by-leetcode-solution/方法一：集合class Solution: def isHappy(self, n: int) -> bool: if n < 0: return Fals...

方法一：二分查找https://leetcode-cn.com/problems/find-in-mountain-array/solution/shan-mai-shu-zu-zhong-cha-zhao-mu-biao-zhi-by-leet/# """# This is MountainArray's API interface.# You should not implemen...

方法一：字典https://leetcode-cn.com/problems/shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof/solution/python3-zi-dian-qiao-jie-by-mu-ren-6/class Solution: def singleNumbers(self, nums: List[int]) -> ...

https://leetcode-cn.com/problems/merge-k-sorted-lists/solution/xiong-mao-shua-ti-python3-3chong-jie-fa-bao-li-you/方法一：暴力法# Definition for singly-linked list.# class ListNode:# def __init__(s...

方法一:class Solution: def permute(self, nums: List[int]) -> List[List[int]]: return list(itertools.permutations(nums))方法二：class Solution: def permute(self, nums: List[int]) ->...

解决方法：编译时加上 -encoding utf-8例如：javac -encoding utf-8 NBody.java