Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //januari 2019 - termin 1
- import java.util.NoSuchElementException;
- import java.util.Scanner;
- 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;
- }
- }
- 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();
- }
- }
- public class GolemiBroevi {
- public static int soberi(SLL<Integer> lista1,SLL<Integer> lista2){
- SLLNode<Integer> temp1= lista1.getFirst();
- SLLNode<Integer> temp2= lista2.getFirst();
- String broj1="";
- String broj2="";
- while(temp1!=null){
- broj1= broj1+ temp1.element+"";
- temp1=temp1.succ;
- }
- while(temp2!=null){
- broj2= broj2+ temp2.element+"";
- temp2=temp2.succ;
- }
- return Integer.parseInt(broj1)+Integer.parseInt(broj2);
- }
- public static void main(String[] args) {
- SLL<Integer> lista1= new SLL<Integer>();
- SLL<Integer> lista2= new SLL<Integer>();
- Scanner input= new Scanner(System.in);
- //int n= Integer.parseInt(input.nextLine());
- String broevi= input.nextLine();
- for(int i=0;i<broevi.length();i++){
- lista1.insertLast(Integer.parseInt(broevi.substring(i,i+1)));
- }
- //int m= Integer.parseInt(input.nextLine());
- broevi= input.nextLine();
- for(int i=0;i<broevi.length();i++){
- lista2.insertLast(Integer.parseInt(broevi.substring(i,i+1)));
- }
- System.out.println(soberi(lista1,lista2));
- }
- }
- /*
- Vlez:
- 996
- 9
- Izlez:
- 1005
- Vlez:
- 1234
- 5678
- Izlez:
- 6912
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement