в 17:43, 31 мая 2010

2010-05-31T17:43:48Z

Admin: 1 версия

2010-05-31T14:11:43Z

1 версия

Новая страница

== Deque: isEmpty() ==



<source lang="java">

import java.util.ArrayDeque;
import java.util.Deque;
public class Main {
public static void main(String args[]) {
Deque<String> stack = new ArrayDeque<String>();
Deque<String> queue = new ArrayDeque<String>();
stack.push("A");
stack.push("B");
stack.push("C");
stack.push("D");
while (!stack.isEmpty())
System.out.print(stack.pop() + " ");
queue.add("A");
queue.add("B");
queue.add("C");
queue.add("D");
while (!queue.isEmpty())
System.out.print(queue.remove() + " ");
}
}

</source>



== Deque: peekFirst() ==



<source lang="java">

import java.util.ArrayDeque;
import java.util.Deque;
public class Main {
public static void main(String[] args) {
MyDequeue stack = new MyDequeue();
for (int i = 0; i < 5; i++) {
stack.push(i);
}
System.out.println("After pushing 5 elements: " + stack);
int m = stack.pop();
System.out.println("Popped element = " + m);
System.out.println("After popping 1 element : " + stack);
int n = stack.peek();
System.out.println("Peeked element = " + n);
System.out.println("After peeking 1 element : " + stack);
}
}
class MyDequeue {
private Deque<Integer> data = new ArrayDeque<Integer>();
public void push(Integer element) {
data.addFirst(element);
}
public Integer pop() {
return data.removeFirst();
}
public Integer peek() {
return data.peekFirst();
}
public String toString() {
return data.toString();
}
}

</source>



== Deque: pop() ==



<source lang="java">

import java.util.ArrayDeque;
import java.util.Deque;
public class Main {
public static void main(String args[]) {
Deque<String> stack = new ArrayDeque<String>();
Deque<String> queue = new ArrayDeque<String>();
stack.push("A");
stack.push("B");
stack.push("C");
stack.push("D");
while (!stack.isEmpty())
System.out.print(stack.pop() + " ");
queue.add("A");
queue.add("B");
queue.add("C");
queue.add("D");
while (!queue.isEmpty())
System.out.print(queue.remove() + " ");
}
}

</source>



== Deque: push(T e) ==



<source lang="java">

import java.util.ArrayDeque;
import java.util.Deque;
public class Main {
public static void main(String args[]) {
Deque<String> stack = new ArrayDeque<String>();
Deque<String> queue = new ArrayDeque<String>();
stack.push("A");
stack.push("B");
stack.push("C");
stack.push("D");
while (!stack.isEmpty())
System.out.print(stack.pop() + " ");
queue.add("A");
queue.add("B");
queue.add("C");
queue.add("D");
while (!queue.isEmpty())
System.out.print(queue.remove() + " ");
}
}

</source>



== Deque: remove() ==



<source lang="java">

import java.util.ArrayDeque;
import java.util.Deque;
public class Main {
public static void main(String args[]) {
Deque<String> stack = new ArrayDeque<String>();
Deque<String> queue = new ArrayDeque<String>();
stack.push("A");
stack.push("B");
stack.push("C");
stack.push("D");
while (!stack.isEmpty())
System.out.print(stack.pop() + " ");
queue.add("A");
queue.add("B");
queue.add("C");
queue.add("D");
while (!queue.isEmpty())
System.out.print(queue.remove() + " ");
}
}

</source>



== Deque: removeFirst() ==



<source lang="java">

import java.util.ArrayDeque;
import java.util.Deque;
public class Main {
public static void main(String[] args) {
MyDequeue stack = new MyDequeue();
for (int i = 0; i < 5; i++) {
stack.push(i);
}
System.out.println("After pushing 5 elements: " + stack);
int m = stack.pop();
System.out.println("Popped element = " + m);
System.out.println("After popping 1 element : " + stack);
int n = stack.peek();
System.out.println("Peeked element = " + n);
System.out.println("After peeking 1 element : " + stack);
}
}
class MyDequeue {
private Deque<Integer> data = new ArrayDeque<Integer>();
public void push(Integer element) {
data.addFirst(element);
}
public Integer pop() {
return data.removeFirst();
}
public Integer peek() {
return data.peekFirst();
}
public String toString() {
return data.toString();
}
}

</source>

← Предыдущая	Версия 17:43, 31 мая 2010
(нет различий)

Java by API/java.util/Deque - История изменений

в 17:43, 31 мая 2010

Admin: 1 версия