永往直前

分类

题解(26)

/ 注册

全部文章（共151篇）

题解 | #矩阵最长递增路径#

import java.util.*; public class Solution { private int[][] dirs = new int[][] { {-1, 0}, {1, 0}, {0, -1}, {0, 1} }; /** ...

2023-02-10

0 363

题解 | #括号生成#

import java.util.*; public class Solution { private ArrayList<String> res = new ArrayList<>(); /** * * @param n int...

2023-02-10

0 283

题解 | #数组中只出现一次的两个数字#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param array int整型一维数组 *...

2023-02-09

0 278

题解 | #数组中出现次数超过一半的数字#

public class Solution { public int MoreThanHalfNum_Solution(int [] array) { if (array == null || array.length < 1) { return...

2023-02-09

0 240

题解 | #两数之和#

import java.util.*; public class Solution { /** * * @param numbers int整型一维数组 * @param target int整型 * @return(756076230) int整型...

2023-02-09

0 268

题解 | #数据流中的中位数#

import java.util.*; public class Solution { private PriorityQueue<Integer> minHeap = new PriorityQueue<>(); private PriorityQueu...

2023-02-09

0 320

题解 | #寻找第K大#

import java.util.*; public class Solution { public int findKth(int[] a, int n, int k) { // write code here if (a == null || n <...

2023-02-09

0 215

题解 | #最小的K个数#

import java.util.*; public class Solution { public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) { ArrayList<...

2023-02-09

0 269

题解 | #滑动窗口的最大值#

import java.util.*; public class Solution { public ArrayList<Integer> maxInWindows(int [] num, int size) { ArrayList<Integer> ...

2023-02-09

0 226

题解 | #滑动窗口的最大值#

import java.util.*; public class Solution { public ArrayList<Integer> maxInWindows(int [] num, int size) { ArrayList<Integer> ...

2023-02-09

0 233