![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
Peter Chan
bulala
展开
-
基于HikariCP的工具类
class HikariCPUtil {// db.properties文件档案// url=jdbc:mysql://localhost:3306/bookshop?useSSL=false&serverTimezone=UTC&allowPublicKeyRetrieval=true// user=root// pass=020...原创 2019-11-08 21:58:32 · 762 阅读 · 0 评论 -
AES算法加密(Java)简单实现
import javax.crypto.*;import javax.crypto.spec.SecretKeySpec;import java.io.UnsupportedEncodingException;import java.security.InvalidKeyException;import java.security.NoSuchAlgorithmException;im...原创 2019-09-24 17:17:39 · 228 阅读 · 0 评论 -
基于dbcp(stream与lambda)的简单应用
main方法实现import java.sql.Connection;import java.sql.ResultSet;import java.sql.SQLException;import java.sql.Statement;import java.util.ArrayList;import java.util.IntSummaryStatistics;import java...原创 2019-05-17 13:57:00 · 204 阅读 · 0 评论 -
Java线程工具类(基于Thread)
class ThreadUtils { private operateThread operator; @SuppressWarnings("unchecked") public <T, K> FutureTask<K> excute(T task) { FutureTask<K> futureTask = null; if (task i...原创 2019-05-22 14:40:29 · 392 阅读 · 0 评论 -
关于DBCP的使用,使用propoties读取配置文件
Marven所需要的依赖包 <dependency> <groupId>org.apache.commons</groupId> <artifactId>commons-dbcp2</artifactId> <version>2.6.0</version> </dependency&...原创 2019-05-16 18:44:04 · 491 阅读 · 0 评论 -
基于netty的简单聊天室
package nettyDemon03;import io.netty.bootstrap.Bootstrap;import io.netty.channel.Channel;import io.netty.channel.ChannelFuture;import io.netty.channel.EventLoopGroup;import io.netty.channel.nio....原创 2019-05-15 20:25:26 · 355 阅读 · 0 评论 -
listen1
const listen1Api = require('../dist/listen1-api');const express = require('express');function search(song_name, platform) { let search = '/search?source=' + platform + '&keywords=' + song_...原创 2019-03-26 10:45:54 · 3326 阅读 · 0 评论 -
C++实现LRU算法
#include <iostream>#include <list>using namespace std;//LRU算法//Blocks 3//data L: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1const int MaxLen = 3;const int Num = 20;typedef struct D...原创 2018-12-11 16:15:56 · 717 阅读 · 0 评论 -
C++实现分配算法
#include <iostream>#include<malloc.h>using namespace std;const int LEN = 640;typedef struct FreeStack{ int len,address; struct FreeStack *next;}*FreeLink;typedef struct B...原创 2018-12-10 18:28:29 · 991 阅读 · 2 评论 -
作业调度算法(Java)
package Task03;import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class App { private List<Integer> arr = new ArrayList<Integer>(); private Scanner sc...原创 2018-11-17 16:27:09 · 2838 阅读 · 1 评论 -
二叉树建树与前后续遍历(Java版)
class Tree_1 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Please Create The Bin_TRee:\t"); String s = sc.nextLine(); Getchar getchar = n...原创 2018-10-24 16:03:50 · 197 阅读 · 0 评论 -
二叉树删除前面节点(C语言初始版)
#include &lt;stdlib.h&gt;#include &lt;stdio.h&gt;typedef struct node{ int key; struct node *left; struct node *right;} Btree;Btree *InsertBtree(Btree *t,int x){ Btree *f = NULL,...原创 2018-10-24 13:31:03 · 650 阅读 · 0 评论 -
进程管理优先调度算法(Java版)
package PCB_Final;import java.util.Scanner;class pcb_Structure { public String name; public int runTime; public int priority; public char state;}class Pcb_main { public int ...原创 2018-10-24 13:37:02 · 990 阅读 · 0 评论 -
KMP算法(C语言)
#include <stdio.h>#include <string.h>int KMP(char *t, char *p, int *next) { int a,i,j; a=0; i=0; j=0; while(i<strlen(t) && a<strlen(p)) if (t[i]==p[a]) { ...原创 2018-10-24 13:29:48 · 258 阅读 · 0 评论 -
C语言N叉树非递归(前中后遍历法)
#include <stdio.h>#include <stdlib.h>typedef struct kk{ char ch; int flag; struct kk *left; struct kk *right;}btree;typedef struct stack{ btree *btree[20]; ...原创 2018-10-24 13:27:17 · 950 阅读 · 0 评论 -
银行家算法
Java银行家算法,最紧缺的资源有优先调用释放算法package Bank;import java.util.ArrayList;import java.util.Arrays;import java.util.Scanner;public class Bank_1 { @Override public String toString() { StringBuilder b...原创 2018-10-20 15:13:06 · 202 阅读 · 0 评论