![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
m0_37588684
Android初级民工
展开
-
堆排序
public class SortHeap { public static void main(String[] args) { int[] nums = {33,0,30,22,18,90,65,6,8,39,59}; headSort(nums); for(int num : nums){ System.out.println(num); } } public static void headSort(int[] list){ //构造初始堆 for(i原创 2020-10-09 10:40:52 · 77 阅读 · 1 评论 -
二叉搜索树
二叉树 public class BST2<Key extends Comparable<Key>,Value> { private Node root; private int size; class Node{ private Node left; private Node right; private Key key; private Value value; public Node(Key key,Value value){原创 2020-10-09 09:21:44 · 63 阅读 · 0 评论 -
约瑟夫环java链表实现
public class Main { public static void main(String[] args) { int n = 41,m = 5;//定义总人数n,和出圈数字m //初始化循环列表,头结点first和尾结点p int size = n; Node first = new Node(1); Node p = first; for(int i=2; i<=n; i++){ Node te原创 2020-09-16 16:29:32 · 177 阅读 · 0 评论