Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**Прв термин: Двострано поврзана листа од карактери. Почнува од напред и се брише 2, 4 6... јазол. Потоа почнува од назад па се бриши претпоследниот, прет-претпоследниот итн. Се додека не остане 1 јазол во листата. Помошни листи не се дозволени.
- Влез: Се вчитува низата со празни места
- Пример: a b c d e f g
- После прво бришење: a c e g
- После второ бришење(од назад) : c g
- Финално бришење (од напред) g
- Да се испечати: c
- */
- //CODE
- import java.util.Scanner;
- class DLLNode<E> {
- protected E element;
- protected DLLNode<E> pred, succ;
- public DLLNode(E elem, DLLNode<E> pred, DLLNode<E> succ) {
- this.element = elem;
- this.pred = pred;
- this.succ = succ;
- }
- @Override
- public String toString() {
- return element.toString();
- }
- }
- class DLL<E> {
- private DLLNode<E> first, last;
- public DLL() {
- // Construct an empty SLL
- this.first = null;
- this.last = null;
- }
- public void deleteList() {
- first = null;
- last = null;
- }
- public int length() {
- int ret;
- if (first != null) {
- DLLNode<E> tmp = first;
- ret = 1;
- while (tmp.succ != null) {
- tmp = tmp.succ;
- ret++;
- }
- return ret;
- } else
- return 0;
- }
- public DLLNode<E> find(E o) {
- if (first != null) {
- DLLNode<E> tmp = first;
- while (tmp.element != o && tmp.succ != null)
- tmp = tmp.succ;
- if (tmp.element == o) {
- return tmp;
- } else {
- System.out.println("Elementot ne postoi vo listata");
- }
- } else {
- System.out.println("Listata e prazna");
- }
- return first;
- }
- public void insertFirst(E o) {
- DLLNode<E> ins = new DLLNode<E>(o, null, first);
- if (first == null)
- last = ins;
- else
- first.pred = ins;
- first = ins;
- }
- public void insertLast(E o) {
- if (first == null)
- insertFirst(o);
- else {
- DLLNode<E> ins = new DLLNode<E>(o, last, null);
- last.succ = ins;
- last = ins;
- }
- }
- public void insertAfter(E o, DLLNode<E> after) {
- if (after == last) {
- insertLast(o);
- return;
- }
- DLLNode<E> ins = new DLLNode<E>(o, after, after.succ);
- after.succ.pred = ins;
- after.succ = ins;
- }
- public void insertBefore(E o, DLLNode<E> before) {
- if (before == first) {
- insertFirst(o);
- return;
- }
- DLLNode<E> ins = new DLLNode<E>(o, before.pred, before);
- before.pred.succ = ins;
- before.pred = ins;
- }
- public E deleteFirst() {
- if (first != null) {
- DLLNode<E> tmp = first;
- first = first.succ;
- if (first != null)
- first.pred = null;
- if (first == null)
- last = null;
- return tmp.element;
- } else
- return null;
- }
- public E deleteLast() {
- if (first != null) {
- if (first.succ == null)
- return deleteFirst();
- else {
- DLLNode<E> tmp = last;
- last = last.pred;
- last.succ = null;
- return tmp.element;
- }
- }
- // else throw Exception
- return null;
- }
- public E delete(DLLNode<E> node) {
- if (node == first) {
- deleteFirst();
- return node.element;
- }
- if (node == last) {
- deleteLast();
- return node.element;
- }
- node.pred.succ = node.succ;
- node.succ.pred = node.pred;
- return node.element;
- }
- @Override
- public String toString() {
- String ret = new String();
- if (first != null) {
- DLLNode<E> tmp = first;
- ret += tmp + "<->";
- while (tmp.succ != null) {
- tmp = tmp.succ;
- ret += tmp + "<->";
- }
- } else
- ret = "Prazna lista!!!";
- return ret;
- }
- public String toStringR() {
- String ret = new String();
- if (last != null) {
- DLLNode<E> tmp = last;
- ret += tmp + "<->";
- while (tmp.pred != null) {
- tmp = tmp.pred;
- ret += tmp + "<->";
- }
- } else
- ret = "Prazna lista!!!";
- return ret;
- }
- public DLLNode<E> getFirst() {
- return first;
- }
- public DLLNode<E> getLast() {
- return last;
- }
- }
- public class BrisiNaizmenicno {
- private static void BrisiNaizmenicno(DLL<String> list) {
- DLLNode<String> first = null;
- DLLNode<String> last = null;
- int count = 1;
- boolean left = true, right = false;
- while (list.length() > 2) {
- if (left) {
- first = list.getFirst();
- while (first != null) {
- if (count == 2) {
- list.delete(first);
- count = 0;
- }
- ++count;
- first = first.succ;
- }
- left = false;
- right = true;
- count = 1;
- }
- if (right) {
- last = list.getLast();
- while (last != null) {
- if (count == 2) {
- list.delete(last);
- count = 0;
- }
- ++count;
- last = last.pred;
- }
- right = false;
- left = true;
- count = 1;
- }
- }
- if (list.length() == 2) {
- if (left)
- list.deleteLast();
- else
- list.deleteFirst();
- }
- System.out.println(list.getFirst().element);
- }
- public static void main(String[] args) {
- Scanner input = new Scanner(System.in);
- DLL<String> list = new DLL<String>();
- String Line = input.nextLine();
- String[] expression = Line.split(" ");
- for (int i = 0; i < expression.length; i++)
- list.insertLast(expression[i]);
- BrisiNaizmenicno(list);
- input.close();
- }
- }
Add Comment
Please, Sign In to add comment