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;
- import java.util.Iterator;
- import java.util.NoSuchElementException;
- class SLL<E> {
- private SLLNode<E> first;
- public SLL() {
- // Construct an empty SLL
- this.first = null;
- }
- public void deleteList() {
- first = null;
- }
- public int length() {
- int ret;
- if (first != null) {
- SLLNode<E> tmp = first;
- ret = 1;
- while (tmp.succ != null) {
- tmp = tmp.succ;
- ret++;
- }
- return ret;
- } else
- return 0;
- }
- @Override
- public String toString() {
- String ret = new String();
- if (first != null) {
- SLLNode<E> tmp = first;
- ret += tmp + "->";
- while (tmp.succ != null) {
- tmp = tmp.succ;
- ret += tmp + "->";
- }
- } else
- ret = "Prazna lista!!!";
- return ret;
- }
- public void insertFirst(E o) {
- SLLNode<E> ins = new SLLNode<E>(o, first);
- first = ins;
- }
- 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 void insertLast(E o) {
- if (first != null) {
- SLLNode<E> tmp = first;
- while (tmp.succ != null)
- tmp = tmp.succ;
- SLLNode<E> ins = new SLLNode<E>(o, null);
- tmp.succ = ins;
- } else {
- insertFirst(o);
- }
- }
- 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;
- }
- }
- public SLLNode<E> getFirst() {
- return first;
- }
- public SLLNode<E> find(E o) {
- if (first != null) {
- SLLNode<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 Iterator<E> iterator () {
- // Return an iterator that visits all elements of this list, in left-to-right order.
- return new LRIterator<E>();
- }
- // //////////Inner class ////////////
- private class LRIterator<E> implements Iterator<E> {
- private SLLNode<E> place, curr;
- private LRIterator() {
- place = (SLLNode<E>) first;
- curr = null;
- }
- public boolean hasNext() {
- return (place != null);
- }
- public E next() {
- if (place == null)
- throw new NoSuchElementException();
- E nextElem = place.element;
- curr = place;
- place = place.succ;
- return nextElem;
- }
- public void remove() {
- //Not implemented
- }
- }
- public void mirror(){
- if (first != null) {
- //m=nextsucc, p=tmp,q=next
- SLLNode<E> tmp = first;
- SLLNode<E> newsucc = null;
- SLLNode<E> next;
- while(tmp != null){
- next = tmp.succ;
- tmp.succ = newsucc;
- newsucc = tmp;
- tmp = next;
- }
- first = newsucc;
- }
- }
- public void merge (SLL<E> in){
- if (first != null) {
- SLLNode<E> tmp = first;
- while(tmp.succ != null)
- tmp = tmp.succ;
- tmp.succ = in.getFirst();
- }
- else{
- first = in.getFirst();
- }
- }
- }
- class SLLNode<E> {
- protected E element;
- protected SLLNode<E> succ;
- public SLLNode(E elem, SLLNode<E> succ) {
- this.element = elem;
- this.succ = succ;
- }
- @Override
- public String toString() {
- return element.toString();
- }
- }
- class Vraboten{
- int id;
- int plata;
- public Vraboten(int id, int plata){
- this.id=id;
- this.plata=plata;
- }
- public int getId(){
- return this.id;
- }
- public int getPlata(){
- return this.plata;
- }
- }
- public class SLLKompanija {
- public static void brisi(SLL<Vraboten> lista,int max){
- SLLNode<Vraboten> tmp = lista.getFirst();
- int br = 0;
- while (tmp != null){
- if (tmp.element.plata < max){
- lista.delete(tmp);
- }
- else{
- br ++;
- }
- tmp = tmp.succ;
- }
- if (br ==0){
- System.out.println("nema");
- }
- else{
- sortiraj(lista);
- }
- }
- public static void sortiraj (SLL<Vraboten> lista){
- SLLNode<Vraboten> tmp = lista.getFirst();
- while (tmp !=null){
- SLLNode<Vraboten> tmp1 = tmp;
- while (tmp1 != null){
- if (tmp.element.id < tmp1.element.id){
- int pom = tmp.element.id;
- tmp.element.id=tmp1.element.id;
- tmp1.element.id=pom;
- int pom1 = tmp.element.plata;
- tmp.element.plata=tmp1.element.plata;
- tmp1.element.plata=pom1;
- }
- tmp1 = tmp1.succ;
- }
- tmp = tmp.succ;
- }
- pecati(lista);
- }
- public static void pecati (SLL<Vraboten> lista){
- SLLNode<Vraboten> tmp = lista.getFirst();
- while (tmp != null){
- System.out.println(tmp.element.id + " " + tmp.element.plata );
- tmp = tmp.succ;
- }
- }
- public static void main(String[] args) throws IOException {
- SLL<Vraboten> lista = new SLL<Vraboten>();
- BufferedReader br = new BufferedReader (new InputStreamReader(System.in));
- String s = br.readLine();
- int n = Integer.parseInt(s);
- for (int i = 0 ; i<n;i++){
- s=br.readLine();
- String s1 = br.readLine();
- lista.insertLast(new Vraboten (Integer.parseInt(s),Integer.parseInt(s1)));
- }
- s = br.readLine();
- int max = Integer.parseInt(s);
- brisi(lista,max);
- }
- }
Add Comment
Please, Sign In to add comment