追梦人胜胜

题解

/ 注册

全部文章 / 题解（共22篇）

题解 | #合并两个有序的数组#

public class Solution { public void merge(int A[], int m, int B[], int n) { int i = m-1, j=n-1,k=m+n-1; while(i>=0 && j...

Java

2021-11-18

0 304

题解 | #最小的K个数#

import java.util.ArrayList; public class Solution { public ArrayList GetLeastNumbers_Solution(int [] input, int k) { ArrayList list = new ArrayList<...

Java

2021-11-17

0 327

题解 | #在二叉树中找到两个节点的最近公共祖先#

import java.util.*; /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; } */ public class Solution { /** * * @param...

Java

2021-11-17

0 279

题解 | #最长无重复子数组#

import java.util.*; public class Solution { /** * * @param arr int整型一维数组 the array * @return int整型 */ public int maxLength (int[] arr) { Map<Intege...

Java

2021-11-17

0 322

题解 | #二分查找-II#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * 如果目标值存在返回下标，否则返回 -1 * @param nums int整型一维数组 * @param target...

Java

2021-11-17

0 295

题解 | #二叉树根节点到叶子节点的所有路径和#

import java.util.*; /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; } */ public class Solution { /** * * @param...

Java

2021-11-08

0 271

题解 | #重建二叉树#

/** Definition for binary tree public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } / import ja...

Java

2021-11-07

0 331

题解 | #在二叉树中找到两个节点的最近公共祖先#

import java.util.*; public class Solution { public int getLongestPalindrome(String A, int n) { // write code here int maxLen =1, start = 0; int[][] dp...

Java

2021-11-07

0 298

题解 | #在二叉树中找到两个节点的最近公共祖先#

import java.util.*; /* public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; } */ public class Solution { /** * * @param...

Java

2021-11-07

0 330

题解 | #反转链表#

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

Java

2021-10-24

0 396