Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class OddEven {
- public static void print(SLL<Integer> lista){
- SLLNode<Integer> tmp=lista.getFirst();
- SLLNode<Integer> tmp2=tmp.succ;
- for(int i=0;i<lista.length();i++){
- if(tmp.element%2!=0){
- tmp2=tmp.succ;
- while (tmp2!=null) {
- if (tmp2.element % 2 != 0) {
- lista.insertBefore(tmp.element-tmp2.element, tmp);
- SLLNode<Integer> naslednik=tmp.succ;
- if(naslednik==tmp2){
- naslednik=tmp2.succ;
- }
- lista.delete(tmp);
- tmp=naslednik;
- lista.delete(tmp2);
- if(tmp==null)
- break;
- break;
- }
- else {
- tmp2 = tmp2.succ;
- }
- }
- }
- else {
- tmp2=tmp.succ;
- while (tmp2!=null) {
- if (tmp2.element % 2 == 0) {
- lista.insertBefore(tmp.element+tmp2.element, tmp);
- SLLNode<Integer> naslednik=tmp.succ;
- if(naslednik==tmp2){
- naslednik=tmp2.succ;
- }
- lista.delete(tmp);
- tmp=naslednik;
- lista.delete(tmp2);
- if(tmp==null)
- break;
- break;
- }
- else {
- tmp2 = tmp2.succ;
- }
- }
- }
- if(tmp==null){
- break;
- }
- }
- System.out.println(lista);
- }
- public static void main(String[] args) {
- Scanner in=new Scanner(System.in);
- int n=in.nextInt();
- SLL<Integer> lista=new SLL<Integer>();
- for(int i=0;i<n;i++){
- lista.insertLast(in.nextInt());
- }
- print(lista);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement