wuxiawei / data-structures-and-algorithms Goto Github PK

class ArrayQueue {
    private int maxSize; // 表示数组的最大容量
    private int front; // 队列头
    private int rear; // 队列尾
    private int[] arr; // 该数据用于存放数据, 模拟队列
    
    // 创建队列的构造器
    public ArrayQueue(int arrMaxSize) {
        maxSize = arrMaxSize;
        arr = new int[maxSize];
        front = -1; // 指向队列头部，分析出 front 是指向队列头的前一个位置. 
        rear = -1; // 指向队列尾，指向队列尾的数据(即就是队列最后一个数据)
    }
    // 判断队列是否满
    public boolean isFull() {
        return rear == maxSize - 1;
    }
    
    // 判断队列是否空
    public boolean isEmpty() {
        return rear == front;
    }
    
    // 添加数据到队列
    public void addQueue(int n) {
        if (isFull()) {
            System.out.println("队列满，不能加入数据~");
            return;
        }
        rear++; // 让 rear 后移
        arr[rear] = n;
    }
    
    // 获取队列的数据, 出队列
    public int getQueue() {
        if (isEmpty()) {
            throw new RuntimeException("队列空，不能取数据");
        }
        front++; // front 后移
        return arr[front];
            }
            
    // 显示队列的所有数据
    public void showQueue() {
        // 遍历
        if (isEmpty()) {
            System.out.println("队列空的，没有数据~~");
            return;
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.printf("arr[%d]=%d\n", i, arr[i]);
            }
        }
        
    // 显示队列的头数据， 注意不是取出数据
    public int headQueue() {
        if (isEmpty()) {
            throw new RuntimeException("队列空的，没有数据~~");
        }
            return arr[front + 1];
        }
}

public void printReverse(){
        HeroNode temp = head.next;
        Stack<HeroNode> stack = new Stack<HeroNode>();
        if(temp == null){
            System.out.println("空链表");
            return;
        }
        while (temp != null){
            stack.add(temp);
            temp = temp.next;
        }
        while (stack.size() > 0){
            HeroNode node = stack.pop();
            System.out.println(node);
        }
    }

public void addNode(HeroNode heroNode){
        if(head.next == null) head.next = heroNode;
        HeroNode temp = head.next;
        while (true){
            if(temp.next == null) break;
            temp = temp.next;
        }
        temp.next = heroNode;
        heroNode.front = temp;
    }

    public void deleteNode(int num){
        if(head.next == null){
            System.out.println("空链表");
            return;
        }
        HeroNode temp = head.next;
        while (true){
            if(temp.no == num) break;
            temp = temp.next;
        }
        temp.next.front = temp.front;
        temp.front.next = temp.next;
    }

class HeroNode{
    public int no;
    public String name;
    public String nickname;
    public HeroNode next;
    public HeroNode front;
    public HeroNode(int no, String name, String nickname){
        this.no = no;
        this.name = name;
        this.nickname = nickname;
    }

    @Override
    public String toString(){
        return "HeroNode [no=" + no + ", name=" + name + ", nickname=" + nickname + "]";
    }
}

Sub aFileNameA()
    Dim Fso, Fldr, s
    Set Fso = CreateObject("Scripting.FileSystemObject")
    Set Fldr = Fso.GetFolder("C:\Users\12965\Desktop\案卷") '假设xls文件在xxxx文件夹
    Application.ScreenUpdating = False
    Application.DisplayAlerts = False
    For Each s In Fldr.Files
        If s.Name Like "*.xls" Then
            Workbooks.Open s
            With ActiveWorkbook
                With ActiveWorkbook
                .ActiveSheet.Rows("1:2").Delete  '删除1至2行 数字在这修改
                .Close SaveChanges:=True
            End With
            End With
        End If
    Next s
    Application.DisplayAlerts = True
    Application.ScreenUpdating = True
    Set Fso = Nothing
End Sub

import java.util.*;

class EditDistance {
    public static int EditDistance(String s, String t) {
        /**
         dis[0][0]表示word1和word2都为空的时候，此时他们的Edit Distance为0。
         dis[0][j]就是word1为空，word2长度为j的情况，此时他们的Edit Distance为j，也就是从空添加j个字符转换成word2的最小Edit Distance为j；
         dis[i][0]就是，word1长度为i，word2为空时，word1需要删除i个字符才能转换成空，所以转换成word2的最小Edit Distance为i
         **/
        int dp[][] = new int[s.length() + 1][t.length() + 1];//建好dp的二维数组，用于保存各种情况的Edit Distance
        char sChar[] = new char[s.length()];
        char tChar[] = new char[t.length()];
        //将String转化成Char数组
        for(int i = 0; i < s.length(); i++) sChar[i] = s.charAt(i);
        for(int i = 0; i < t.length(); i++) tChar[i] = t.charAt(i);
        //初始化dp(i = 0 和 j = 0 时的情况)
        for(int i = 0; i <= s.length(); i++) dp[i][0] = i;
        for(int j = 0; j <= t.length(); j++) dp[0][j] = j;
        //动态规划方程
        for(int i = 1; i <= s.length(); i++){
            for(int j = 1; j <= t.length(); j++){
                int flag;
                if(sChar[i - 1] == tChar[j - 1])
                    flag = 0;
                else
                    flag = 1;
                //dp[i-1][j]+1表示删掉字符串a最后一个字符a[i]
                //dp[i][j-1]+1表示给字符串添加b最后一个字符
                //dp[i-1][j-1]+flag表示改变,相同则不需操作次数,不同则需要,用flag记录

                dp[i][j]=Math.min(dp[i-1][j]+1,Math.min(dp[i][j-1]+1,dp[i-1][j-1]+flag));
            }
        }
        return dp[s.length()][t.length()];
    }
    public static void main(String args[]) {
        Scanner scan = new Scanner(System.in);

        String s = scan.next();
        String t = scan.next();

        System.out.println(EditDistance(s, t));
    }

}

public class SparseArray {
    public static void main(String[] args) {
        
        //初始化新数组
        int chessArr1[][] = new int[11][11];
        chessArr1[1][2] = 1;
        chessArr1[2][3] = 2;
        //打印
        for(int[] row: chessArr1){
            for (int data: row){
                System.out.printf("%d\t",data);
            }
            System.out.println();
        }
        
        //统计有多少个非0元素
        int sum = 0;
        for(int i = 0; i < chessArr1.length; i++){
            for(int j = 0; j < chessArr1[0].length; j++){
                if(chessArr1[i][j] != 0) sum++;
            }
        }
        
        //创建稀疏数组，原数组转化成稀疏数组
        int chessArr2[][] = new int [sum + 1][3];
        chessArr2[0][0] = 11;
        chessArr2[0][1] = 11;
        chessArr2[0][2] = sum;

        int count =0;
        for(int i = 0; i < 11; i++){
            for (int j = 0; j < 11; j++){
                if(chessArr1[i][j] != 0){
                    count++;
                    chessArr2[count][0] = i;
                    chessArr2[count][1] = j;
                    chessArr2[count][2] = chessArr1[i][j];
                }
            }
        }
        
        //打印稀疏数组
        System.out.println("稀疏数组：");
        for(int[] row: chessArr2){
            for (int data: row){
            System.out.printf("%d\t", data);
            }
            System.out.println();
        }
    }
}

class CircleArrayQueue{
    private int maxSize; // 表示数组的最大容量
    private int front; // 队列头
    private int rear; // 队列尾
    private int[] arr; // 该数据用于存放数据, 模拟队列

    public CircleArrayQueue(int len){
        maxSize = len;
        front = 0;
        rear = 0;
        arr = new int[maxSize];

    }

    //判断队列是否为满
    public boolean isFull(){
        if((rear + 1) % maxSize == front) return true;
        return false;
    }

    //判断队列是否为空
    public boolean isEmpty(){
        if(rear == front) return true;
        return false;
    }

    //数据个数
    public int size(){
        return (rear + maxSize - front) % front;
    }

    //加入数据
    public void addQueueData(int data){
        // 判断队列是否满
        if (isFull()) {
            System.out.println("队列满，不能加入数据~");
            return;
        }
        arr[rear] = data;
        rear = (rear + 1) % maxSize;
    }

    //取出数据
    public int getQueueData(){
        // 判断队列是否空
        if (isEmpty()) {
            throw new RuntimeException("队列为空，没有数据");
        }
        int value = arr[front];
        front = (front + 1) % maxSize;
        return value;
    }

    //显示所有数据
    public void viewQueueData() {
        // 判断队列是否空
        if (isEmpty()) {
            throw new RuntimeException("队列为空，没有数据");
        }
        for (int i = front; i < front + size(); i++) {
            System.out.printf("arr[%d]=%d\n", i % maxSize, arr[i % maxSize]);
        }
    }

    // 显示队列的头数据， 注意不是取出数据
    public int headQueue() {
        // 判断
        if (isEmpty()) {
            throw new RuntimeException("队列空的，没有数据~~");
        }
        return arr[front];
    }

}

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Pisano {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        final long n = scanner.nextLong();
        final long m = scanner.nextLong();
        System.out.println(computeFibonacciPisano(n, m));
    }

    private static long computeFibonacciPisano(long n, long m) {
        final List<Long> pisanoPeriodValues = new ArrayList<>();
        pisanoPeriodValues.add(0L);
        pisanoPeriodValues.add(1L);
        int i = 0;

        while (!(i > 0 && pisanoPeriodValues.get(i) == 0 && pisanoPeriodValues.get(i + 1) == 1)) {
            final long a = pisanoPeriodValues.get(i) % m;
            final long b = pisanoPeriodValues.get(i + 1) % m;
            final long sum = (a + b) % m;
            pisanoPeriodValues.add(sum);
            i++;
        }
        final long index = n % i;
        return pisanoPeriodValues.get((int) index);
    }
}

<dependency>
   <groupId>org.springframework.boot</groupId>
   <artifactId>spring-boot-starter-thymeleaf</artifactId>
</dependency>

import numpy as np
a = np.array([[1,0,2],[0,0,1],[0,0,1]])  # (3 * 3)

b = np.array([1,2,1])  # (3,) 抛开线性代数的行向量和列向量，这里他是二者都可以的

c1 = a * b  # 相当于[1,2,1]这个数作用于每一列
c2 = b * a  # 这里是作为一个行向量的， （1 * 3）@ (3 *3) = (1 * 3) 结果还是显示（3,）
# 这里的 c1 = c2

public void reverseNode(){
        HeroNode newHeadNode = new HeroNode(0,"","");
        HeroNode temp = head.next;
        HeroNode temporaryNode = null;
        while (true){
            if(temp == null){
                break;
            }
            //遍历原来的链表，每遍历一个节点，就将其取出，并放在新的链表 reverseHead 的最前端
            temporaryNode = temp.next; //先暂时保存当前节点的下一个节点，因为后面需要使用
            temp.next = newHeadNode.next; //将 temp 的下一个节点指向新的链表的最前节点（非头节点）
            newHeadNode.next = temp; //将新头节点指向temp完成插入
            temp = temporaryNode; //temp在原节点后移
        }
        head.next = newHeadNode.next; //最后将原头节点指向新链的第一个节点
    }

class HeroNode{
        public int no;
        public String name;
        public String nickname;
        public HeroNode next;
        public HeroNode(int no, String name, String nickname){
            this.no = no;
            this.name = name;
            this.nickname = nickname;
    }