π+1

摘要： import java.util.*; public class Solution { public int evalRPN(String[] tokens) { //int temp = 0; Stack stack = new Stack(); for( int i = 0; i < tokens.length; i++)... 阅读全文

摘要： /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ import java.util.*; public class... 阅读全文

摘要： public class Solution { public int movingCount(int threshold, int rows, int cols) { if(threshold =0 && row=0 && col0){ sum+=number%10; number = number/10; ... 阅读全文

摘要： public class Solution { public boolean hasPath(char[] matrix, int rows, int cols, char[] str) { boolean[] visited = new boolean[matrix.length]; if( matrix == null || matrix.le... 阅读全文

摘要： import java.util.*; public class Solution { public ArrayList maxInWindows(int [] num, int size) { ArrayList list = new ArrayList(); if( num == null || size == 0 ){ ... 阅读全文

摘要： import java.util.*; public class Solution { List list = new ArrayList(); public void Insert(Integer num) { list.add(Double.valueOf(num)); Collections.sort(list); } p... 阅读全文

摘要： /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ import java.util.*; public class... 阅读全文

摘要： /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ public class Solution { //序列化... 阅读全文

摘要： import java.util.ArrayList; /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ imp... 阅读全文

摘要： import java.util.ArrayList; /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; } } */ impo... 阅读全文