数据结构与算法
。
lllAndCat
这个作者很懒,什么都没留下…
展开
-
堆/二叉排序树(Java)
核心code:package com.sort;public class heapsort { public static void main(String[] args) { int[] a = {1, 4, 3, 5, 2, 7, 12, 45, 13, 754, 124, 754, 6, 32, 45, 1}; heap(a); for (int b : a) System.out.println(b); } publ原创 2022-04-25 18:30:32 · 381 阅读 · 1 评论 -
哈希表存电话号码的实现(Java_HashSet)
哈希+单链表核心code://哈希表存人员电话public class hashtabdemo { public static void main(String[] args) { hash hash = new hash(5); data peo = new data(32 , 138387); hash.add(peo); hash.read(32); }}class data{ public int原创 2022-04-24 16:56:33 · 872 阅读 · 0 评论 -
二分查找&插值查找(Java)
二分核心code:public int binary(int[] a,int key){ int l = 0,r = a.length-1; while (l<=r){ int mid = (l+r)/2; if(a[mid]==key) return mid; else if (a[mid]<key) l=mid+1; else r=mid-1;原创 2022-04-22 11:12:16 · 604 阅读 · 0 评论 -
基数排序(桶排序)(Java)
核心code:此代码仅为处理正数。处理负数时正负分开处理即可。public class bucketsort { public static void main(String[] args) { int[] a = {1, 4, 3, 5, 2, 7, 12, 45, 13, 754, 124, 754, 6, 32, 45, 1}; bucketsort bucketsort = new bucketsort(); bucketsort原创 2022-04-22 00:59:54 · 795 阅读 · 0 评论 -
归并排序(Java)
核心code:package com.sort;public class mergesort { public static void main(String[] args) { int[] a = {1, 4, 3, 5, 2, 7, 12, 45, 13, 754, 124, 754, 6, 32, 45, 1}; mergesort mergesort = new mergesort(); mergesort.merge(a);原创 2022-04-22 00:00:23 · 218 阅读 · 0 评论 -
快速排序(java)
核心code:public class quicksort { public static void main(String[] args) { int[] a = {1, 4, 3, 5, 2, 7, 12, 45, 13, 754, 124, 754, 6, 32, 45, 1}; quicksort quicksort = new quicksort(); quicksort.quick(a, 0, a.length - 1);原创 2022-04-19 16:03:54 · 298 阅读 · 0 评论 -
插入排序(二分优化)(java)
核心code:public class insertsort { public insertsort() { } public static void main(String[] args) { int[] a = new int[]{1, 4, 3, 5, 2, 7}; insertsort insertsort = new insertsort(); insertsort.insert(a); int[] v原创 2022-04-19 13:30:44 · 723 阅读 · 0 评论 -
选择排序(java)
核心code:public class selectsort { public selectsort() { } public static void main(String[] args) { int[] a = new int[]{1, 4, 3, 5, 2, 7}; selectsort selectsort = new selectsort(); selectsort.select(a); int[] v原创 2022-04-19 13:29:18 · 41 阅读 · 0 评论 -
冒泡排序(java)
核心code:public class bubblesort { public bubblesort() { } public static void main(String[] args) { int[] a = new int[]{1, 4, 3, 5, 2, 7}; bubblesort bubblesort = new bubblesort(); bubblesort.bubble(a); int[] v原创 2022-04-19 13:27:33 · 559 阅读 · 0 评论 -
希尔排序(java)
public class shellsort { public static void main(String[] args) { int[] a = {1,4,3,5,2,7}; shellsort shellsort = new shellsort(); shellsort.shell(a); for(int b: a) System.out.println(b); } public void shell(int[.原创 2022-04-19 13:25:41 · 186 阅读 · 0 评论 -
栈(java)
核心code://创建栈class stack{private int length;private int front;private int top;private int[] stack;//创建构造器public stack(int length) {this.length = length;this.front = 0;this.top = 0;this.stack = new i...原创 2022-04-18 20:28:01 · 169 阅读 · 0 评论 -
循环队列(java)
核心code://创建数组队列类class queue {private int maxsize;private int front;private int rear;private int[] queue;//创建构造器public queue(int maxsize) {this.maxsize = maxsize;this.front = 0;this.rear = 0;this.q...原创 2022-04-18 20:26:37 · 261 阅读 · 0 评论 -
单链表(java)
核心code://节点定义class linknode{public int data;public linknode next;//构造器public linknode(int data) {this.data = data;}}//创建单链表操作类class linklist{private linknode head = new linknode(0);//增加节点public boolean Addlink(......原创 2022-04-18 20:25:05 · 122 阅读 · 0 评论 -
稀疏矩阵存放(java)
有时矩阵存放数据过于稀少,这时就可以利用稀疏矩阵进行存储,如将矩阵转化为n行3列的矩阵进行存放,存放数据的行、列、数值等信息。核心code:import java.util.Scanner;public class sparsearray {public sparsearray() {}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);......原创 2022-04-18 20:22:55 · 284 阅读 · 0 评论