perf:make findFeasiblePaths faster

Signed-off-by: qinguoyi <1532979219@qq.com>

pkg/scheduler/core/spreadconstraint/select_groups.go

@@ -158,6 +158,23 @@ func findFeasiblePaths(groups []*GroupInfo, minConstraint, maxConstraint, target
 		})
 	}
 
+	if len(groups) < minConstraint {
+		return
+	}
+
+	if len(groups) == minConstraint {
+		var sum int
+		rootPath := new(dfsPath)
+		for _, i := range groups {
+			sum += i.value
+			rootPath.enqueue(i)
+		}
+		if sum >= target {
+			paths = append(paths, rootPath.next())
+		}
+		return
+	}
+
 	rootPath := new(dfsPath)
 	var dfsFunc func(int, int)
 	dfsFunc = func(sum, begin int) {