删除一个单项链表的最中间的元素，要求时间尽可能短（不能使用两次循环）java

public class DeleteMiddleLinkInList {


/**
* @param args删除一个单项链表的最中间的元素，要求时间尽可能短（不能使用两次循环）
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
    List list=new List();
    int[] array={1,2,3,4,5,6};
    list.setLen(array.length);
    list.setArray(array);
    list.InsertLast(array);
    list.displaylist();
    list.delete(array.length);
    list.displaylist();
}
  
}
class List{
Link first;
Link last;
int len;
int[] array;

public void setLen(int len) {
this.len = len;
}
public void setArray(int[] array) {
this.array = array;
}
public List(){
first=null;
last=null;
}
public boolean isEmpty(){
return first==null;
}
public void InsertLast(int[] array){
for(int i=0;i<array.length;i++){
Link newlink=new Link(array[i]);
if(isEmpty()){
first=newlink;
}else{
last.next=newlink;
}
last=newlink;
}

}
public Link delete(int len){
Link current=first;
Link previous=first;
if(len%2==0){
int i=1;
while(i!=len/2){
i++;
if(current.next==null){
return null;
}else{
previous=current;
current=current.next;
}
}
previous.next=current.next;
return current;
}else{
int i=1;
while(i!=(len/2+1)){
i++;
if(current.next==null){
return null;
}else{
previous=current;
current=current.next;
}
}
previous.next=current.next;
return current;
}
}
public void displaylist(){
Link current=first;
while(current!=null){
current.displaylink();
current=current.next;
}
}
}