![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Mooc作业
浙江大学数据结构Mooc
我头好痒啊
这个作者很懒,什么都没留下…
展开
-
07-图4 哈利·波特的考试
//07-图4 哈利·波特的考试 import java.util.Scanner; class Graph{ private int V; private int E; private int MaxSum = 1000; private int[][] adv; public Graph(int V, int E){ this.V = V; this.E = E; adv = new int[V][V];原创 2020-09-04 14:32:17 · 86 阅读 · 0 评论 -
06-图2 Saving James Bond - Easy Version
//06-图2 Saving James Bond - Easy Version import java.util.Scanner; import java.lang.Math; import java.util.ArrayList; import java.util.Stack; class node{ int data; node next; } class location{ int x; int y; } public class Main { sta原创 2020-09-03 13:21:05 · 86 阅读 · 0 评论 -
06-图1 列出连通集
//06-图1 列出连通集 import java.util.Scanner; import java.util.Stack; import java.util.LinkedList; import java.util.Queue; class node{ int data; node next; } public class Main { public static boolean[] visited = new boolean[10]; static void原创 2020-09-02 15:23:33 · 78 阅读 · 0 评论 -
01-复杂度3 二分查找&02-线性结构1 两个有序链表序列的合并
//01-复杂度3 二分查找 Position BinarySearch( List L, ElementType X ){ int start, end, mid, p; int len = L -> Last; start = 1; end = len; p = 0; while(start <= end){ mid = (start + end) / 2; if(L -> Data[mid] &原创 2020-09-01 16:52:34 · 71 阅读 · 0 评论 -
05-树8 File Transfer
//05-树8 File Transfer(Java实现按照解题思路还是超时,也没找到用Java完美实现的代码囧) import java.util.Scanner; public class Main { static int find(int[] c, int x){ if(c[x] <= 0){ return x; } else return c[x] = find(c, c[x]);原创 2020-09-01 14:16:35 · 96 阅读 · 0 评论 -
05-树7 堆中的路径
//05-树7 堆中的路径 import java.util.Scanner; class heap{ final int Max_Size = 1000; final int Min_Data = -10000; int[] elements= new int[Max_Size + 1]; int size = 0; int capacity = Max_Size; heap(){ this.elements[0] = Min_Data原创 2020-08-30 08:44:18 · 76 阅读 · 0 评论 -
04-树7 二叉搜索树的操作集
链接转载 2020-08-29 10:32:46 · 101 阅读 · 0 评论 -
04-树6 Complete Binary Search Tree
//04-树6 Complete Binary Search Tree import java.util.Scanner; public class Main { final int Max_Size = 1024; static int Leftsubnum(int N){ int n = 0; int sum = 0; int i= 0; int diceng = 0; while(sum <=原创 2020-08-28 19:47:45 · 84 阅读 · 0 评论 -
04-树5 Root of AVL Tree
//04-树5 Root of AVL Tree import java.util.Scanner; class Tnode{ int data = 0; Tnode left; Tnode right; int h; } public class Main{ static int Max(int a, int b){ return a > b ? a : b; } static int GetH(Tnode T){原创 2020-08-28 14:31:26 · 67 阅读 · 0 评论 -
04-树4 是否同一棵二叉搜索树
//04-树4 是否同一棵二叉搜索树 import java.util.ArrayList; import java.util.Scanner; class TNode{ int data = 0; int right = -1; int left = -1; } public class Main { static TNode[] add(TNode[] Ts, TNode t, TNode T){ if(t.data < T.data){原创 2020-08-27 15:24:31 · 82 阅读 · 0 评论 -
03-树3 Tree Traversals Again
import java.util.Scanner; class node{ int number = 0; int left = 30; int right = 30; } public class Main { final static int Max_Size = 30; static int count = 0; static node[] Read(Scanner s) { //Stack<Integer> stack = new Stack<>();原创 2020-08-21 15:46:43 · 78 阅读 · 0 评论 -
03-树2 List Leaves
//03-树2 List Leaves import java.util.Scanner; import java.util.ArrayList; class node{ int left; int right; } public class Main { final static int Max_Size = 10; static ArrayList<Integer> Path(node[] T, int leaf, int R) { ArrayList<In原创 2020-08-21 00:05:20 · 68 阅读 · 0 评论 -
03-树1 树的同构
//03-树1 树的同构 import java.util.Scanner; class node{ String zimu; int left; int right; } public class Main { final static int Max_Size = 10; static node[] Read(Scanner s) { node[] T = new node[Max_Size + 1]; int n = 0; n = s.nextInt(); Str原创 2020-08-20 16:24:52 · 119 阅读 · 0 评论 -
02-线性结构4 Pop Sequence(链表实现堆栈)
数组实现堆栈可以AC但是用链表实现堆栈第五个测试点会卡住,上下求索而不得其解所以记录一下 // 02-线性结构4 Pop Sequence(链表实现堆栈) import java.util.Scanner; //import java.util.ArrayList; class sNode{ int data; int p; sNode next; public sNode(int x, int y) { this.data = x; this.p = y; } } public c原创 2020-08-18 10:43:45 · 173 阅读 · 0 评论 -
02-线性结构3 Reversing Linked List
// 02-线性结构3 Reversing Linked List import java.util.Scanner; class Node{ String address; String data; String Nextaddress; Node next; public Node() { this.next = null; } public Node(String x, String y, String z) { this.address = x; this.data =原创 2020-08-16 10:08:28 · 64 阅读 · 0 评论 -
02-线性结构2 一元多项式的乘法与加法运算
// 02-线性结构2 一元多项式的乘法与加法运算 import java.util.Scanner; class Node{ int xishu; int zhishu; Node next; Node(int x, int y){ xishu = x; zhishu = y; } Node(){ this.next = null; } void add(int x, int y) { Node newnode = new Node(x, y); if(this.x原创 2020-08-15 11:20:15 · 80 阅读 · 0 评论 -
01-复杂度2 Maximum Subsequence Sum
// 01-复杂度2 Maximum Subsequence Sum import java.util.Scanner; public class test{ static int start, end; static int MaxSum(int N, int[] a) { int maxsum = 0; int thissum = 0; for(int i = 0; i < N; i ++) { thissum += a[i]; if(thissum > max原创 2020-08-15 09:03:14 · 59 阅读 · 0 评论