硌手的小虫子

分类

/ 注册

全部文章（共92篇）

题解 | #二叉树的后序遍历#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-09-21

0 44

题解 | #二叉树的中序遍历#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-09-21

0 54

题解 | #二叉树的前序遍历#

import java.util.*; /* * public class TreeNode { * int val = 0; * TreeNode left = null; * TreeNode right = null; * public TreeNode(int v...

2024-09-21

0 47

题解 | #比较版本号#

import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * 比较版本号 * @param version1 string字符串...

2024-09-21

0 61

题解 | #旋转数组的最小数字#

import java.util.*; public class Solution { //归并排序 // public int minNumberInRotateArray (int[] nums) { // mergeSort(nums,0,nums.length-1...

2024-09-21

0 54

题解 | #数组中的逆序对#

public class Solution { int count=0; public int InversePairs(int[] array) { mergeSort(array,0,array.length-1); return count; ...

2024-09-21

0 57

题解 | #寻找峰值#

import java.util.*; public class Solution { // public int findPeakElement (int[] nums) { // if (nums.length == 1||nums[0] > nums[1]) ...

2024-09-18

0 59

题解 | #二分查找-I#

import java.util.*; public class Solution { public int search (int[] nums, int target) { int left=0; int right=nums.length-1; ...

2024-09-17

0 62

题解 | #删除有序链表中重复的元素-II#

import java.util.*; public class Solution { public ListNode deleteDuplicates (ListNode head) { ListNode node=head; HashMap<Int...

2024-09-17

0 62

题解 | #删除有序链表中重复的元素-I#

import java.util.*; public class Solution { public ListNode deleteDuplicates (ListNode head) { if(head==null||head.next==null){ ...

2024-09-17

0 62