weixin_41993767的博客

一：用两个栈实现队列import java.util.Stack;public class Solution { Stack<Integer> stack1 = new Stack<Integer>(); Stack<Integer> stack2 = new Stack<Integer>(); publi...

package offer;public class offer_8<E extends Comparable<E>> { private class Node{ E e; Node left,right,parent; ...

方法一:用栈基于循环实现import java.util.ArrayList;import java.util.Stack;public class Solution { public ArrayList<Integer> printListFromTailToHead(ListNode listNode) { Stack<Integer>...

算法过程:1.选取数组中右上角的数字2.如果该数字小于target,则删除这个数字所在的行row++3.如果该数字大于target,则删除这个数字所在的列column--public class Find { public static boolean findNum(int[][] matrix,int target) { ...

package offer;public class Duplication { private int countRange(int[] arr,int l,int r) { int count=0; ...