Thread: request

import java.util.Random;
 
public class DLinkedList {
 
private class Node {
int item;
Node next;
Node previous;
 
}
 
private Node head = null;
 
 
public void Insert(int item) {
if( head==null){
head = new Node();
head.item = item;
head.next = head;
head.previous = head;
}else{
Node newNode = new Node();
newNode.item = item;
Node tail = head.previous;
tail.next = newNode;
newNode.previous = tail;
newNode.next = head;
head.previous = newNode;
}
}
 
 
public boolean insertAfter(int key, int item) {
   Node first=null;
  Node last=null;
    Node current = first;
  //  System.out.println( key);
    while (current.item !=key) {
 
      current = current.next;
      if (current == null){
        return false;
      }
    }
   Node newNode = new Node();
 
    if (current == last) {
     newNode.next = null;
     last = newNode;
 } 
    else {
      newNode.next = current.next;
 
      current.next.previous = newNode;
    }
    newNode.previous = current;
    current.next = newNode;
    return true;
 }
 
 
public int count() {
if( head==null){
return 0;
}
Node node = head;
int count = 0;
while( true){
node = node.next;
if( node!=head){
count++;
}else{
break;
}
}
if( head==null){
System.out.println( " List is empty");
}else{
//Node node = head.previous.next;
    int x=1;
while(x <= count/2){
node = node.next;
x++;
if( node!=head){
System.out.print( node.item + " ");
}else{
break;
}
}
//System.out.println();
}
return count;
}
 
 
 
//public int getLargest() {
//number below is the bottom negative range of integer
//int largest = -2147483648;
//if( head==null){
//return largest;
//}
//Node node = head;
//largest = head.item;
//while( true){
//node = node.next;
//if( node!=head){
//if( node.item > largest){
//largest = node.item;
//}
//}else{
//break;
//}
//}
//return largest;
//}
 
public void print(){
if( head==null){
System.out.println( " List is empty");
}else{
Node node = head.previous.next;
while( true){
node = node.next;
if( node!=head){
System.out.print( node.item + " ");
}else{
break;
}
}
System.out.println();
}
}
 
 
 
public static void main( String[] args){
DLinkedList list = new DLinkedList();
//Random random = new Random();
 
//randomly add between 5 to 14 numbers to list
for(int i=1; i<10; i++){
//random insert numbers between 0 and 100, not including 100
list.Insert(i);
}
 
list.print();
System.out.println( "the middle of list after item no. " + list.count()/2 );
//System.out.println( "The larget number in the list is " + list.getLargest());
list.insertAfter(5, 77);
list.print();
}
}

--- Update ---

i post it again.i did like this every time but i do not know where the problem

can you copy it and paste in your IDE??

Untitled.jpgUntitled1.jpg

look!! this is the capture of the code

it is formatted!!

--- Update ---

ok thank you..i think you are annoying from me

Originally Posted by aegr

it is formatted!!

--- Update ---

ok thank you..i think you are annoying from me

He's trying to help you if you let him. He has much more patience than most of us, trust me, and it is needed in this thread to be sure. Myself, I'd be much more blunt with you, and so I will keep out of this thread except for this post.

i type

 and paste the code and type

,formate the size
this is not the first time i post code in forums!!

--- Update ---

thank you..for your patiance..you see the captures?

--- Update ---

import java.util.Random;
 
public class DLinkedList {
 
private class Node {
int item;
Node next;
Node previous;
 
}
 
private Node head = null;
 
 
public void Insert(int item) {
if( head==null){
head = new Node();
head.item = item;
head.next = head;
head.previous = head;
}else{
Node newNode = new Node();
newNode.item = item;
Node tail = head.previous;
tail.next = newNode;
newNode.previous = tail;
newNode.next = head;
head.previous = newNode;
}
}
 
 
public boolean insertAfter(int key, int item) {
   Node first=null;
  Node last=null;
    Node current = first;
  //  System.out.println( key);
    while (current.item !=key) {
 
      current = current.next;
      if (current == null){
        return false;
      }
    }
   Node newNode = new Node();
 
    if (current == last) {
     newNode.next = null;
     last = newNode;
 } 
    else {
      newNode.next = current.next;
 
      current.next.previous = newNode;
    }
    newNode.previous = current;
    current.next = newNode;
    return true;
 }
 
 
public int count() {
if( head==null){
return 0;
}
Node node = head;
int count = 0;
while( true){
node = node.next;
if( node!=head){
count++;
}else{
break;
}
}
if( head==null){
System.out.println( " List is empty");
}else{
//Node node = head.previous.next;
    int x=1;
while(x <= count/2){
node = node.next;
x++;
if( node!=head){
System.out.print( node.item + " ");
}else{
break;
}
}
//System.out.println();
}
return count;
}
 
 
 
//public int getLargest() {
//number below is the bottom negative range of integer
//int largest = -2147483648;
//if( head==null){
//return largest;
//}
//Node node = head;
//largest = head.item;
//while( true){
//node = node.next;
//if( node!=head){
//if( node.item > largest){
//largest = node.item;
//}
//}else{
//break;
//}
//}
//return largest;
//}
 
public void print(){
if( head==null){
System.out.println( " List is empty");
}else{
Node node = head.previous.next;
while( true){
node = node.next;
if( node!=head){
System.out.print( node.item + " ");
}else{
break;
}
}
System.out.println();
}
}
 
 
 
public static void main( String[] args){
DLinkedList list = new DLinkedList();
//Random random = new Random();
 
//randomly add between 5 to 14 numbers to list
for(int i=1; i<10; i++){
//random insert numbers between 0 and 100, not including 100
list.Insert(i);
}
 
list.print();
System.out.println( "the middle of list after item no. " + list.count()/2 );
//System.out.println( "The larget number in the list is " + list.getLargest());
list.insertAfter(5, 77);
list.print();
}
}

--- Update ---

i will be crazy!!!what is the problem

Originally Posted by aegr

i type

 and paste the code and type

,formate the size
this is not the first time i post code in forums!!

--- Update ---

thank you..for your patiance..you see the captures?

We see your posted code, and while it has *some* formatting, it is not *well formatted* since you are not using indentation in a uniform and standard way.

<blunt>Look. You are asking for free help from volunteers. Is it really asking too much of you to put in just a little effort to post *well formatted* code so that we can more easily read your code and understand it? </blunt>

thank you for all