public ListNode middleNode(ListNode head){
ListNode[] result =newListNode[100];int t =0;//一定要判断头元素是否为空if(head==null){return null;}else{
result[t]=head;}while(head.next != null){
head = head.next;//一定是++t而不是t++
result[++t]= head;}//因为t是从0开始的,所以要先+1return result[(t+1)/2];}