a1084958096的博客

import java.util.*; public class ArrayListRemove { //字符字符 public static void HashMapDemo1(){ HashMap<String, String> hashMap = new HashMap<String, String>(); hash...

正确的做法是backtrack. 回文判断从中间判断比较划算，因为一旦失败，就没有继续往外判断的意义了，可以back track。所以就遍历，从遍历的位置为中心往两边判断。需要注意，ABA ABBA这俩都算回文，第一个中心是B，第二个是BB（也可以看做是BB之间的空隙）。所以遍历的时候，每个位置要先以当前字母为中心，再以当前字母和他右边那个为中心。。class Solution { pub...

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any...

Combinations Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. Example: Input: n = 4, k = 2 Output:[[2,4],[3,4], [2,3],[1,2],[1,3], [1,4]] import java.uti...

102 二叉树层序遍历 迭代 队列的dfs经典问题 class Solution(object): def levelOrder(self, root): """ :type root: TreeNode :rtype: List[List[int]] """ if not root: ...