数据结构
XiaoM将故事
决定人生高度的从来都不是做事的完美程度,而是做事的速度.
展开
-
红黑树的简单插入
p,u遍黑色,z变红色p变黑色,z变红色,以p为轴,pz为半径右旋。以x为轴,px为半径左旋(x向上走),得到二图情形。class Node { int data; boolean isRed;//是红节点还是黑节点 Node parent; Node leftChiled; Node rightChiled; public Node(int data) { this.data原创 2017-04-28 17:32:22 · 242 阅读 · 0 评论 -
有序链表实现优先队列
/** * 有序链表的优先队列 * */class Lin { public int data; public Lin next; public Lin(int i) { data=i; } public void displayLin() { System.out.print(data+" "); }}class LinList { private Lin fi原创 2017-04-19 16:38:44 · 1486 阅读 · 0 评论 -
hdu 1412
合并两个集合{A}+{B},使用了链表的方式import java.util.Scanner;/** * 两个集合合并 * */class Link { public int data; public Link next; public Link(int d) { data=d; }}class LinkList { private Link first; pub原创 2017-04-19 17:00:10 · 324 阅读 · 0 评论 -
Uva_679
import java.util.Scanner;public class Main{ public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int maxd = 20; boolean[] s = new boolean[1 << 20]; while (sca原创 2017-07-25 21:15:27 · 235 阅读 · 0 评论 -
【Leetcode】712. Minimum ASCII Delete Sum for Two Strings
DescriptionGiven two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.Example 1:Input: s1 = "sea", s2 = "eat"Output: 231Explanation: Deleting "s" fro...原创 2018-08-08 00:45:18 · 250 阅读 · 0 评论