java 块状链表

节点类

package BlockLinkList;

import java.util.ArrayList;



public class BlockLinkNode {
	
	
         
         public BlockLinkNode prev;

         
         public BlockLinkNode next;

        
         public ArrayList<Integer> list;
         
         public BlockLinkNode(BlockLinkNode prev,BlockLinkNode next,ArrayList<Integer> list)
         {
         	
         	this.prev=prev;
         	this.next=next;
         	this.list=list;
         	
         }
         
     }

块状链表

package BlockLinkList;
import java.util.*;

public class BlockLinkList {

	
	public BlockLinkNode blockLinkNode = null;
	private int total;
	
	        public BlockLinkList()
	        {
	            //初始化节点
	        	
	        	// blockLinkNode = new BlockLinkNode(null,null,list);
	      
	        }
	
	        
	        
	
	       
	
	        
	        public boolean IsExist(int num)
	        {
	            boolean isExist = false;
	
	            BlockLinkNode temp = blockLinkNode;
	
	            while (temp != null)
	            {
	                //判断是否在该区间内
	                if (temp.list.size()-1 > 0 && num >= temp.list.get(0) && num <= temp.list.get(temp.list.size() - 1))
	                {
	                    isExist = temp.list.indexOf(num) > 0 ? true : false;
	
	                    return isExist;
	                }
	
	                temp = temp.next;
	            }
	
	            return isExist;
	        }