关于百度地图 规划路径只有11个点的问题

Draw () {
        this.markers.forEach((val) => {
          this.mapPoint.push(new this.BMap.Point(val.lng, val.lat))
        })
        //显示轨迹
        
        this.$nextTick(() => {
        this.showPoly(this.mapPoint)
        })
      },
      showPoly (pointList) {
        //循环显示点对象
        console.log(this.BMap)
        this.map.clearOverlays()
        for(let c=0;c<pointList.length;c++){
        var marker = new this.BMap.Marker(pointList[c]);
        marker.setLabel(this.markers[c].name);
        this.map.addOverlay(marker);
        //将途经点按顺序添加到地图上
        var label = new this.BMap.Label(c+1,{offset:new this.BMap.Size(20,-10)});
        console.log(label.content)
        label.content = this.markers[c].name
        console.log('label')
        marker.setLabel(label);
        }

       var  group = Math.floor( pointList.length /11 ) ;
       var mode = pointList.length %11 ;

       var driving = new this.BMap.DrivingRoute( this.map, {onSearchComplete: (results) =>{
              if (driving.getStatus() == BMAP_STATUS_SUCCESS){
                     var plan = driving.getResults().getPlan(0);
                     var  num = plan.getNumRoutes();
                     for(var j =0;j<num ;j++){
                      var pts= plan.getRoute(j).getPath();    //通过驾车实例，获得一系列点的数组
                      var polyline = new this.BMap.Polyline(pts);    
                      this.map.addOverlay(polyline); 
                     }
              }
        }});
        for(var i =0;i<group;i++){
           var waypoints = pointList.slice(i*11+1,(i+1)*11);
           //注意这里的终点如果是11的倍数的时候，数组可是取不到最后一位的，所以要注意终点-1喔。感谢song141的提醒，怪我太粗心大意了~
           driving.search(pointList[i*11], pointList[(i+1)*11-1],{waypoints:waypoints});//waypoints表示途经点
        }   
        if( mode != 0){
         var waypoints = pointList.slice(group*11,pointList.length-1);//多出的一段单独进行search
         driving.search(pointList[group*11],pointList[pointList.length-1],{waypoints:waypoints});
        }
    },