https://jinpingxiao.github.io//Algorithm Learning 2026-03-01T15:57:54+00:00 Jinping Xiao https://jinpingxiao.github.io// Jekyll © 2026 Jinping Xiao /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png 2025-11-13T05:52:00+00:00 2025-11-13T05:52:00+00:00 https://jinpingxiao.github.io//posts/segment-tree/ Jinping Xiao

What is Segment Tree? Segment Tree is a type of binary tree, which is used to solve the question in a range, such as finding the max one or min one in range L to R. The segment tree will divide the node [L, R] into left node [L, M] and right node[M + 1, R], M = (L + R) / 2 until L = R. So it’s obvious that the tree node is range instead of the number. In this case, the container which contain ...

2025-11-11T02:36:00+00:00 2025-11-11T02:36:00+00:00 https://jinpingxiao.github.io//posts/binary-indexed-tree/ Jinping Xiao

What is Binary Indexed Tree The Binary Indexed Tree is used to solve the question of range sum query and point update. Giving a series of numbers, we suppose that we need the sum of index L to R, then we need to traverse the number of index L to R and sum them up. The time complexity is $O(n)$ or $O(R - L + 1)$, too slow. If we want to update a number of it, we just select it and change it, th...

2025-11-05T08:40:00+00:00 2025-11-05T08:40:00+00:00 https://jinpingxiao.github.io//posts/eternal-band/ Jinping Xiao

在这个博客中，我们将要着重学习后端设计，并了解数据库的基本使用。 注：为简化学习，将前端框架置于此，不再单独讲解。（后续讲解前端调用后端API流程时会提到） 该项目提供三个页面（可跳转） index.html <!DOCTYPE html> <html lang="zh-CN"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>BanG Dream! 乐队查询系统</title> <style> * { margin: 0; ...

2025-10-31T05:45:00+00:00 2025-11-06T16:25:22+00:00 https://jinpingxiao.github.io//posts/a-direction-program/ Jinping Xiao

简单网页设计 后端设计 一、所需工具 1.工具和框架 由于该项目仅供学习使用，不接入真实服务器，故使用Node.js来部署一个本地HTTP服务器，并用Express框架来处理前端请求，托管静态网页，图片和脚本程序。 const express = require('express'); // 导入Express框架 const path = require('path');// 安全处理和拼接文件路径 const app = express(); // 创建一个express应用对象， const PORT = 3000; // 设置端口号，3000是惯例设置 app.use(express.json()); // 主要用来处理前端发送的POST请求 app.use(express.static(path.join(__dirname, 'src/public'))); ...

2025-10-18T07:48:00+00:00 2025-10-18T13:23:31+00:00 https://jinpingxiao.github.io//posts/a/ Jinping Xiao

What is A-star? A-star is the algorithm solving the single source shortest path question, which combined the Dijkstra and Heuristic Search. That means the A* is Dijkstra with eyes! How does it work? We need three functions: $dist$: the real distance between start and the current node; $h$: the estimate distance between the current node and the end; $f$: the total...