function findPathCount (blockList, boxList){
    //排序将块按重量从小到大排序,箱子从小到大排序
    sortBlock(blockList);
    sortBoxList(boxList);
    var pathCount = 0;
    //取出最大的块
    var currentBlock = blockList.pop();
    //计算次数
    for(var countBox = 0;countBox < boxList.length;countBox++) {
        //当前块的重量小于箱子的最大容量，则计算路径数量
        if(currentBlock.weight < boxList[countBox].capacity)
        {
            //如果没有多余的块，满足条件，合理路径+1
            if(blockList.length == 0){
                pathCount += 1;
            }
            else {
                //将箱子数组复制一份，方便递归计算
                var copyBox = boxList.copy();
                copyBox[countBox].capacity = copyBox[countBox].capacity - currentBlock.weight
                pathCount += findPathCount(blockList,copyBox);
            }
        }
    }
    return pathCount;
}