Coder789

分类

题解(31)

/ 注册

全部文章（共31篇）

题解 | #精灵鼠从入口到出口的最少减少速度#

import java.io.*; import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); ...

Java

2021-09-23

0 632

题解 | #顺时针打印数字矩阵#

import java.io.*; import java.util.*; public class Main{ public static void main(String[] args){ Scanner sc = new Scanner(System.in); ...

Java

2021-09-23

0 458

题解 | #顺时针打印矩阵#

import java.util.ArrayList; public class Solution { public ArrayList<Integer> printMatrix(int [][] matrix) { ArrayList<Integer>...

数组

2021-09-09

0 462

题解 | #树的子结构#

/** public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = v...

树

2021-09-08

0 374

题解 | #链表中环的入口结点#

/* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } } */ public class Solution {...

链表

2021-09-02

0 342

题解 | #链表中倒数最后k个结点#

import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * public ListNode(int val) { * this.val = val; * ...

链表

2021-09-02

0 357

题解 | #包含min函数的栈#

import java.util.Stack; public class Solution { Stack<Integer> minStack = new Stack<>(); Stack<Integer> dataStack = new St...

堆栈

2021-09-02

0 342

题解 | #用两个栈实现队列#

import java.util.Stack; public class Solution { Stack<Integer> stack1 = new Stack<Integer>(); Stack<Integer> stack2 = new S...

堆栈

2021-09-02

0 308

题解 | #第一个只出现一次的字符#

public class Solution { public int FirstNotRepeatingChar(String str) { if(str == null || str.length() == 0){ return -1; ...

数组

2021-09-02

0 329

题解 | #顺时针打印矩阵#

import java.util.ArrayList; public class Solution { public ArrayList<Integer> printMatrix(int [][] matrix) { ArrayList<Integer>...

数组

2021-09-02

0 347