基础算法
1. 快速排序
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] q = new int[n];
for (int i = 0; i < n; i++) {
q[i] = scan.nextInt();
}
quick_sort(q, 0, n - 1);
for (int i = 0; i < n; i++) {
System.out.print(q[i] + " ");
}
}
public static void quick_sort(int[] q, int l, int r) {
if (l >= r) return;
int x = q[l], i = l - 1, j = r + 1;
while (i < j) {
do i++; while(x > q[i]); //找到第一个大于等于x的数,不能取=,因为第一个数可能比后面所有数都大,必须交换第一个数
do j--; while(x < q[j]); //找到第一个小于等于x的数,不能取=
// 交换两个数,保证i左边数小于等于x,j右边数大于等于x
if (i < j) {
int tmp = q[i];
q[i] = q[j];
q[j] = tmp;
}
}
quick_sort(q, l, j); // j有可能小于i,所以取j
quick_sort(q, j + 1, r);
}
}
2. 归并排序
import java.util.Scanner;
public class Main {
static final int N = 100010;
static int[] q = new int[N];
static int[] tmp = new int[N];
private static void merge_sort(int[] q, int l, int r) {
if (l >= r) return;
int mid = (l + r) >> 1;
merge_sort(q, l, mid);
merge_sort(q, mid + 1, r);
int k = 0, i = l, j = mid + 1;
while (i <= mid && j <= r) {
if (q[i] <= q[j]) tmp[k++] = q[i++];
else tmp[k++] = q[j++];
}
while (i <= mid) tmp[k++] = q[i++];
while (j <= r) tmp[k++] = q[j++];
for (i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
for (int i = 0; i < n; i++) {
q[i] = scan.nextInt();
}
merge_sort(q, 0, n - 1);
for (int i = 0; i < n; i++) {
System.out.print(q[i] + " ");
}
}
}
3. 整数二分
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int q = scan.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = scan.nextInt();
}
while (q-- > 0) {
int k = scan.nextInt();
int l = 0, r = n - 1;
while (l < r) {
int mid = (l + r) >> 1;
if (a[mid] >= k) r = mid;
else l = mid + 1;
}
if (k != a[l]) System.out.print("-1 -1\n");
else {
System.out.print(l + " ");
l = 0;
r = n - 1;
while (l < r) {
int mid = (l + r + 1) >> 1; // 因为l=mid,所以当l,r相邻时取mid=r
if (a[mid] <= k) l = mid;
else r = mid - 1;
}
System.out.print(l + "\n");
}
}
}
}
4. 浮点数二分
输入一个浮点数x,求√x
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x = scan.nextDouble();
double l = 0, r = x;
while (r - l > 1e-6) {
double mid = (l + r) / 2;
if (mid * mid > x) r = mid;
else l = mid;
}
System.out.println(l);
}
}
5. 高精度加法
输入:两行,各一个正整数
输出:两大数之和
// 从个位开始存储,个位存在下标为0的空间
import java.util.*;
public class Main {
public static List<Integer> add(List<Integer> A, List<Integer> B) {
List<Integer> C = new ArrayList();
int t = 0; // 进位
for (int i = 0; i < A.size() || i < B.size(); i++) {
if (i < A.size()) t += A.get(i);
if (i < B.size()) t += B.get(i);
C.add(t % 10); // 余数
t /= 10; // 商为进位,或者判断t是否大于10,再取0或1
}
if (t > 0) C.add(1);
return C;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String a = scan.nextLine();
String b = scan.nextLine();
List<Integer> A = new ArrayList(), B = new ArrayList();
for (int i = a.length() - 1; i >= 0; i--) A.add(a.charAt(i) - '0');
for (int i = b.length() - 1; i >= 0; i--) B.add(b.charAt(i) - '0');
List<Integer> C = add(A, B);
for (int i = C.size() - 1; i >= 0; i--) System.out.print(C.get(i));
}
}
6. 高精度减法
输入:两行,各一个正整数
输出:两大数之和
import java.util.*;
public class Main {
// 判断是否有 A >= B
public static boolean cmp(List<Integer> A, List<Integer> B) {
if (A.size() != B.size()) return A.size() > B.size();
for (int i = A.size() - 1; i >= 0; i--) {
if (A.get(i) != B.get(i)) return A.get(i) > B.get(i);
}
return true;
}
public static List<Integer> sub(List<Integer> A, List<Integer> B) {
List<Integer> C = new ArrayList();
int t = 0; // 差
for (int i = 0; i < A.size(); i++) {
t += A.get(i);
if (i < B.size()) t -= B.get(i);
C.add((t + 10) % 10); // t >= 0: t; t < 0 : t + 10(借位)
if (t < 0) t = -1;
else t = 0;
}
while(C.size() > 1 && C.get(C.size() - 1) == 0) C.remove(C.size() - 1); // 删除前导0
return C;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String a = scan.nextLine();
String b = scan.nextLine();
List<Integer> A = new ArrayList(), B = new ArrayList();
for (int i = a.length() - 1; i >= 0; i--) A.add(a.charAt(i) - '0');
for (int i = b.length() - 1; i >= 0; i--) B.add(b.charAt(i) - '0');
if (cmp(A, B)) {
List<Integer> C = sub(A, B);
for (int i = C.size() - 1; i >= 0; i--) System.out.print(C.get(i));
}
else {
System.out.print("-");
List<Integer> C = sub(B, A);
for (int i = C.size() - 1; i >= 0; i--) System.out.print(C.get(i));
}
}
}
7. 高精度乘法
输入:两行,各一个正整数A, b (A为大数)
输出:两数之积
// 从个位开始存储,个位存在下标为0的空间
import java.util.*;
public class Main {
public static List<Integer> mul(List<Integer> A, int b) {
// 将b看成一个整体,作为乘数,依次和A中每一位相乘
List<Integer> C = new ArrayList();
int t = 0; // 进位
for (int i = 0; i < A.size() || t > 0; i++) {
if (i < A.size()) t += A.get(i) * b;
C.add(t % 10); // 余数
t /= 10; // 商
}
int i = C.size();
while(i > 1 && C.get(i - 1) == 0) C.remove(i-- - 1); // 删除前导0
return C;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String a = scan.nextLine();
int b = scan.nextInt();
List<Integer> A = new ArrayList();
for (int i = a.length() - 1; i >= 0; i--) A.add(a.charAt(i) - '0');
List<Integer> C = mul(A, b);
for (int i = C.size() - 1; i >= 0; i--) System.out.print(C.get(i));
}
}
8. 高精度除法
输入:两行,各一个正整数A, b (A为大数)
输出:两行,商和余数
// 除法可按顺序存储在数组,但题目中可能涉及其他运算,所以存储方式需保持统一:
// 从个位开始存储,个位存在下标为0的空间
import java.util.*;
public class Main {
static int r; // 余数
public static List<Integer> div(List<Integer> A, int b) {
List<Integer> C = new ArrayList();
r = 0;
for (int i = A.size() - 1; i >= 0; i--) {
// 余数乘10加当前位 除以b
r = r * 10 + A.get(i);
C.add(r / b);
r %= b;
}
Collections.reverse(C); // 需反向存储,与其他运算保持统一
int i = C.size();
while(i > 1 && C.get(i - 1) == 0) C.remove(i-- - 1); // 删除前导0
return C;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String a = scan.nextLine();
int b = scan.nextInt();
List<Integer> A = new ArrayList();
for (int i = a.length() - 1; i >= 0; i--) A.add(a.charAt(i) - '0');
List<Integer> C = div(A, b);
for (int i = C.size() - 1; i >= 0; i--) System.out.print(C.get(i));
System.out.println("\n" + r);
}
}
9. 前缀和 与 查分
// 求a[]数组的前缀和:
for(int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i - 1]; // 前缀和下标[1, n],数组a下标[0, n - 1]
sum[l, r] = s[r] - s[l - 1] // 第l个数 到 第r个数 的和
// 求a[][]数组左上角元素的和:
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m;j++)
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + a[i - 1][j - 1];
int x1, y1, x2, y2;
s[x2][y2] - s[x1 - 1][y2] - s[x1][y1 - 1] + s[x1 - 1][y1 - 1] // 矩形区域和
// 求a[]数组的差分数组b[], b[]的前缀和即为a[]
b[0] = a[0];
for (int i = 1; i <= n; i++) b[i] = a[i] - a[i - 1];
b[l] += c, b[r + 1] -= c // [l, r] 中每个a[i] 都加上c
// 求a[][]的差分数组b[][]
b[i][j] = a[i][j] - a[i - 1][j] - a[i][j - 1] + a[i - 1][j - 1]
// 求原数组值,只需应用求二维前缀和方法
10. 双指针
for (int i = 0, j = 0; i < n; i++) {
while (j < i && check(i, j)) j++;
// do something
}
11. 位运算
// 位运算:
x & 1 // 判断末尾是否为1(判断奇偶性)
x | (1 << k) // 第k + 1位赋值为1
x ^ (1 << k) // 第k + 1位取反
(x >> k) & 1 // 判断x第k + 1位是否为1
x ^ (x + 1) // 取右边连续的1 ????????
x & (-x), -x = (~x + 1) // 取最低位1的位置 (负数补码为,源码取反+1(符号位不变))
a ⊕ b = c -> a = b ⊕ c
12. 离散化
离散化:将稀疏的数映射到[1, n]的数组上,数可能很大
如:1,10,1000, 20000000映射到1,2,3,4, 避免开大数组num[20000000]
import java.util.*;
// 存储add中的x, c; query中的l, r
class Pair {
int x, y;
Pair(int x, int y) {
this.x = x;
this.y = y;
}
}
public class Main {
public static void main(String[] args) {
List<Pair> add = new ArrayList(); // 在x位置加c
List<Pair> query = new ArrayList(); // 询问[l, r]区间和
Set<Integer> set = new TreeSet(); // 涉及到的位置 x, l, r
Map<Integer, Integer> map = new HashMap(); // 将位置映射到[1, n]
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int m = scan.nextInt();
for (int i = 0; i < n; i++) {
int x = scan.nextInt();
int c = scan.nextInt();
add.add(new Pair(x, c)); // 输入x, c
set.add(x); // 坐标x加入有序set
}
for (int i = 0; i < m; i++) {
int l = scan.nextInt();
int r = scan.nextInt();
query.add(new Pair(l, r)); // 输入l, r
set.add(l); // 坐标l, r加入set
set.add(r);
}
int index = 1;
for (int x : set) {
map.put(x, index++); // 将坐标映射到[1, n]
}
int k = set.size();
int[] nums = new int[k + 1];
int[] sum = new int[k + 1];
// 坐标x映射到index,给num[index]加上c
for (int i = 0; i < n; i++) {
Pair p = add.get(i);
index = map.get(p.x);
nums[index] += p.y;
}
// 求区间和
for (int i = 1; i <= k; i++) {
sum[i] = sum[i - 1] + nums[i];
}
// 将询问映射到[1, n]的坐标,求解区间和
for (int i = 0; i < m; i++) {
int l = query.get(i).x;
int r = query.get(i).y;
int ans = sum[map.get(r)] - sum[map.get(l) - 1];
System.out.println(ans);
}
}
}
13. 区间合并
import java.util.*;
class Pair {
int l, r;
Pair(int l, int r) {
this.l = l;
this.r = r;
}
}
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[][] a = new int[n][2];
for (int i = 0; i < n; i++) {
a[i][0] = in.nextInt();
a[i][1] = in.nextInt();
}
Arrays.sort(a, (o1, o2) -> o1[0] - o2[0]); // 按区间左端点排序
List<Pair> ans = new ArrayList();
int start = (int)-10e9, end = (int)-10e9; // 维护一个当前区间,下一个区间有重合则合并,不重合则重置当前区间
for (int[] b : a) {
if (end < b[0]) {
if (end != (int)-10e9) ans.add(new Pair(start, end));
start = b[0];
end = b[1];
} else {
end = Math.max(end, b[1]);
}
}
if (end != (int)-10e9) ans.add(new Pair(start, end));
System.out.println(ans.size());
}
}