zhanghanqmx的博客

栈中添加辅助栈实现栈储存minclass MinStack { Stack<Integer> A, B; public MinStack() { A = new Stack<>(); B = new Stack<>(); } public void push(int x) { A.add(x); if(B.empty() || B.peek() >= x)

反转链表class Solution { public ListNode reverseList(ListNode head) { ListNode cur = head, pre = null; while(cur != null) { ListNode temp = cur.next; // 暂存后继结点 cur.next cur.next = pre; // 修改 next 引用指向

利用双栈实现链表操作class CQueue { private int count; private ListNode head; private ListNode tail; public CQueue() { count = 0; } public void appendTail(int value) { ListNode node = new ListNode(value); if (head ==

输入流与输出流真难记o(╥﹏╥)o

从尾到头打印链表class Solution { public int[] reversePrint(ListNode head) { LinkedList<Integer> stack = new LinkedList<Integer>(); while(head != null) { stack.addLast(head.val); head = head.next; }

三目运算符public class FindMaxMin{ public static void main(String agrs[]){ double d1=1,d2=2,d3=3; double temp,max,min; //求三个数的最大值 temp=d1>d2?d1:d2; max=temp>d3?temp:d3; //求三个数的最小值 temp=d1<d2?

统计字母个数import java.io.*;//引入缓冲字符输入流类（BufferedReader）和字符输入流类（InputStreamReader）public class IfElseTest{ public static void main(String args[]) throws IOException{//main()方法把IOException异常抛出，交给Java虚拟机处理该异常 String str; BufferedReader buf;

逆序存放4位数public class ReverselyStoreIntegers{ public static void main(String args[]){ int n=1234,m; int a,b,c,d; d=n/1000; c=n/100%10; b=n/10%10; a=n%10; m=a*1000+b*100+c*10+d; System.out.p