Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.IOException;
- import java.io.InputStreamReader;
- class SLLNode<E>
- {
- E element;
- SLLNode<E> succ;
- public SLLNode(E element, SLLNode succ)
- {
- this.element = element;
- this.succ = succ;
- }
- }
- class SLL<E>
- {
- SLLNode<E> first;
- public SLL()
- {
- first = null;
- }
- public void insertFirst(E element)
- {
- SLLNode<E> nov = new SLLNode(element,first);
- first = nov;
- }
- public void insertLast(E element)
- {
- if(first==null)
- {
- insertFirst(element);
- }
- else
- {
- SLLNode<E> nov = new SLLNode(element,null);
- SLLNode<E> dvizi = first;
- while(dvizi.succ!=null)
- {
- dvizi = dvizi.succ;
- }
- dvizi.succ = nov;
- }
- }
- public void insertAfter(E o, SLLNode<E> node) {
- if (node != null) {
- SLLNode<E> ins = new SLLNode<E>(o, node.succ);
- node.succ = ins;
- } else {
- System.out.println("Dadenot jazol e null");
- }
- }
- public void insertBefore(E o, SLLNode<E> before) {
- if (first != null) {
- SLLNode<E> tmp = first;
- if(first==before){
- this.insertFirst(o);
- return;
- }
- //ako first!=before
- while (tmp.succ != before)
- tmp = tmp.succ;
- if (tmp.succ == before) {
- SLLNode<E> ins = new SLLNode<E>(o, before);
- tmp.succ = ins;
- } else {
- System.out.println("Elementot ne postoi vo listata");
- }
- } else {
- System.out.println("Listata e prazna");
- }
- }
- public E deleteFirst() {
- if (first != null) {
- SLLNode<E> tmp = first;
- first = first.succ;
- return tmp.element;
- } else {
- System.out.println("Listata e prazna");
- return null;
- }
- }
- public E delete(SLLNode<E> node) {
- if (first != null) {
- SLLNode<E> tmp = first;
- if(first ==node){
- return this.deleteFirst();
- }
- while (tmp.succ != node&&tmp.succ.succ != null)
- tmp = tmp.succ;
- if (tmp.succ == node) {
- tmp.succ = tmp.succ.succ;
- return node.element;
- } else {
- System.out.println("Elementot ne postoi vo listata");
- return null;
- }
- } else {
- System.out.println("Listata e prazna");
- return null;
- }
- }
- @Override
- public String toString()
- {
- String s = new String();
- SLLNode<E> dvizi = first;
- while(dvizi!=null)
- {
- s = s + dvizi.element + " ";
- dvizi = dvizi.succ;
- }
- return s;
- }
- }
- public class SmeniSosediPEDZA {
- public static void zameni(SLL<Integer>lista,int m)
- {
- SLLNode<Integer> dvizi= lista.first;
- if(m!=1)
- {
- while(dvizi!=null)
- {
- SLLNode<Integer> dvizi1= dvizi.succ;
- for(int i=1;i<m;i++)
- {
- SLLNode<Integer> d2= lista.first;
- if(dvizi1!=null)
- {
- if(dvizi==lista.first)
- {
- lista.insertBefore(dvizi1.element, dvizi);
- dvizi=lista.first;
- lista.delete(dvizi1);
- if(dvizi1!=null)
- {
- dvizi1=dvizi1.succ;
- }
- }
- else
- {
- lista.insertBefore(dvizi1.element, dvizi);
- lista.delete(dvizi1);
- while(d2.succ!=dvizi)
- {
- d2=d2.succ;
- }
- dvizi=d2;
- if(dvizi1!=null)
- {
- dvizi1=dvizi1.succ;
- }
- }
- }
- }
- dvizi=dvizi1;
- }
- }
- else
- {
- System.out.println(lista);
- }
- System.out.println(lista);
- }
- public static void main(String[] args)throws IOException {
- BufferedReader stdin=new BufferedReader(new InputStreamReader(System.in));
- int N=Integer.parseInt(stdin.readLine());
- String s=stdin.readLine();
- String []pom=s.split(" ");
- SLL<Integer>lista=new SLL();
- for(int i=0;i<N;i++)
- {
- lista.insertLast(Integer.parseInt(pom[i]));
- }
- int M=Integer.parseInt(stdin.readLine());
- zameni(lista, M);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement