爱敲代码的小豪

分类

/ 注册

全部文章（共97篇）

题解 | 两两交换链表中的结点

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

2026-02-06

0 5

题解 | 小苯的比赛上分

#include <stdio.h> #include <stdlib.h> #include <limits.h> // 定义最小堆结构 typedef struct { long long* data; // 存储堆元素（用long long防溢出...

2026-02-06

0 5

题解 | 小苯的比赛上分

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

2026-02-06

0 5

题解 | 两端问优先队列

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

2026-02-06

0 5

题解 | 字符串优先队列

import java.util.*; public class Main { // 使用Java的PriorityQueue实现字典序最小的字符串堆 static PriorityQueue<String> s = new PriorityQueue<>(...

2026-02-06

0 5

题解 | 结构体优先队列

import java.util.*; class Student { int chinese, math, english, sum; public Student(int chinese, int math, int english) { this.chine...

2026-02-06

0 4

题解 | 【模板】整数优先队列

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

2026-02-06

0 5

题解 | 不重复数字

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

2026-02-06

0 6

题解 | 宝石计数

import java.util.*; public class Solution { public int numJewelsInStones (String jewels, String stones) { HashMap<Character,Integer>...

2026-02-06

0 5

题解 | 快乐数

import java.util.*; public class Solution { public int powSum(int n){ int ans = 0; while(n>0){ int t = n%10; ...

2026-02-06

1 5