说明：  　　　最先适应分配算法 FF算法要求空闲分区链以地址递增的次序链接。在分配内存时，从链首开始顺序查找，直到找到一个大小能满足要求的空闲分区为止；然后再按作业大小，从该分区中划出一块内存空间分配给请求者，余下的空闲分区仍留在空闲链中
(The first to adapt to the the allocation algorithm the FF algorithms require idle Zoning chain to address increasing order link. Allocate memory from the chain first began to order for the size of the job until you find a size to the idle partition so far to meet the requirements then draw from the partition a memory space allocated to the requester, the rest of the free partition remain In the idle chain)