(Constructor) public A (int n){ for (int i = 0; i < n; i++) { new A(i); } System.out.println("*"); }

Transcription

1 !!#!#"! (Constructor) A public A (int n){ for (int i = 0; i < n; i++) { new A(i); System.out.println("*"); % 1. new A(0); 2. new A(1); 3. new A(2); 4. new A(3); & ) n 5. A a = new A(n);!

2 '#" +"()* " %floating point" ( floating point"

3 ! ( x, '

4 Turtle turtle = new Turtle(); " 1. DrunkTurtle x = (DrunkTurtle)turtle; 2. Point x = (Point)turtle; 3. Turtle x = (DrunkTurtle)turtle 4. DrunkTurtle x = turtle; '! (, ' - subclass" ) super class" % % override" subclass" ) super class" % % override"

5 / public class A { public boolean equals(a other) { return true;. public boolean equals(object other) { return this == other; public static void main (String[] args) { A a1 = new A(); Object a2 = new A(); System.out.println(a1.equals(a2)); // System.out.println(a2.equals(a1)); // System.out.println(a1.equals(new A())); // System.out.println(((A)a2).equals(a1)); // %! %( %, %'

6 % % Java 0 %! (, Bubble-Sort" + n-1 " % %(Selection-Sort)

7 (complexity) * / n Complexity" public static void method1(int n) { int k; for (int i = 1 ; i <= n ; i++) { for (int j = n ; j > 1 ; j=j/2) { k++; public static void method2(int n) { for (int i = 1 ; i <= n ; i = i * 2) { method1(); method1 method2

8 -# -#"!-!-!!!!)!#!#!')!# -' //!#!#!'!'!,!,!( Javadoc 1 " Node Node Node links!node public class Node { private Object data; protected Node[] links; // All methods implementation (see below)!# Interface Node " Constructors public Node(Object data, int n) Creates a node holding the given data and with n links to other nodes. protected Node(int n) Creates a node with n links to other nodes. The data will be set to null. This constructor is defined for use by subclasses. Data Handling protected void setdata(object data) Set the data inside the node. Defined for use by subclasses. public Object getdata() Get the data stored in the node Link Handling public int getnumlinks() Return the number of links in this node public void setnext(int i,node next) throws IndexOutOfBoundsException Set i-th link of this node to the given node (zero based) public Node getnext(int i) throws IndexOutOfBoundsException Get the i-th link of this node (zero based) General public String tostring() Simply returns the String representation of the data stored in the node!

9 public class Node { private Object data; protected Node[] links;

10

11 Nodes%Links Node null% Node% &! creategraph()" # Node nullnode #!# 0 1 public static void creategraph() { 2

12 Node BinNode:Node!# #! Node Node! # Node& ('Node NodeBinNode"! Constants public static final int RIGHT_SON Denotes the right son public static final int LEFT_SON Denotes the left son Constructors public BinNode(Object data) Creates a binary node which stores the given data. The left and right links are set to null. Link Handling public void setright(binnode right) Sets the right son of the node to the given node public void setleft(binnode left) Sets the left son of the node to the given node public BinNode getright() Returns the right son of this node public BinNode getleft() Returns the left son of this node ListNode Node! Node% Node Node! #Node& ('Node NodeListNode"! Constructors public ListNode(Object data) Creates a list node which stores the given data. The next links is set to null. public ListNode(Object data,listnode next) Creates a list node which stores the given data and sets the next link to the given node. Link Handling public void setnext(listnode next) Sets the right son of the node to the given node public ListNode getnext() Returns the right son of this node

13 public class BinNode extends Node {

14

15 & " List 'Node &!List # public class List { private ListNode head; private int size; public List() { head = null; size = 0; public int getsize() { return size; public void addelement(object element) { ListNode newnode = new ListNode(element,null); if (size == 0) { head = newnode; else { getnodeat(size-1).setnext(newnode); size++; public Object getelementat(int i) throws IndexOutOfBoundsException { return getnodeat(i).getdata(); protected ListNode getnodeat(int i) throws IndexOutOfBoundsException { // <-- your code should come here public void removeelementat(int i) throws IndexOutOfBoundsException { // <-- your code should come here public String tostring() { StringBuffer buff = new StringBuffer(); ListNode node = head; while (node!= null) { buff.append(node.tostring()+"\n"); node = node.getnext(); return buff.tostring();

16 !List " protected ListNode getnodeat(int i) throws IndexOutOfBoundsException Returns the node at position i in the list (zero based). Throws IndexOutOfBounds exception if i is negative or greater than or equal to the number of nodes. protected ListNode getnodeat(int i) throws IndexOutOfBoundsException { public void removeelementat(int i) throws IndexOutOfBoundsException Removes an element at position i from the list (zero based). Throws IndexOutOfBounds exception if i is negative or greater than or equal to the number of nodes. public void removeelementat(int i) throws IndexOutOfBoundsException {

17 !% protected ListNode getnodeat(int i) i Node%& member method List Node%)%Node! (DFS) public static void printdfs(node n) { // your code here *#Node%)% #

18 "! # Integer# List *Integer :Integer &!" # Compares two objects numerically. Parameters:!" - the to be compared. Returns: the value if this is equal to the argument ; a value less than if this is numerically less than the argument ; and a value greater than if this % %%% &' ()* +# is numerically greater than the argument (signed comparison). Returns the value of this as an. Returns: the numeric value represented by this object after conversion to type. List static"! ListPackage #List Integers -1 &*Integer! # public static int findminindex(list list) {

19 List static" '&! ListPackage #List Integers # &*Integer! public static List sort(list list) {!sort public static void main(string[] args) { java.util.random r = new java.util.random(); List l = new List(); for (int i = 0 ; i < 20 ; i++) { l.addelement(new Integer(r.nextInt()%100)); System.out.println(l); l = sort(l); System.out.println(l); +% sort #&!