xvcain的博客

//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];

//06-图2 Saving James Bond - Easy Versionimport 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

//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

//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] &

//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]);

//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

链接

//04-树6 Complete Binary Search Treeimport 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 <=

//04-树5 Root of AVL Treeimport 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){

//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){

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<>();

//03-树2 List Leavesimport 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

//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

数组实现堆栈可以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

// 02-线性结构3 Reversing Linked Listimport 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 =

// 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

// 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