调整复杂组合方案
parent
96411f2225
commit
baf8fd2240
|
|
@ -441,6 +441,7 @@ class JclqService implements IJingcai
|
||||||
$inputData = [];
|
$inputData = [];
|
||||||
foreach ($data as $id => $item) {
|
foreach ($data as $id => $item) {
|
||||||
if (count($item) == 1) {
|
if (count($item) == 1) {
|
||||||
|
continue;
|
||||||
$itemValues = array_values($item);
|
$itemValues = array_values($item);
|
||||||
if (isset($itemValues[0]) && count($itemValues[0]) == 1) {
|
if (isset($itemValues[0]) && count($itemValues[0]) == 1) {
|
||||||
continue;
|
continue;
|
||||||
|
|
|
||||||
|
|
@ -1011,6 +1011,7 @@ class JczqService implements IJingcai
|
||||||
$inputData = [];
|
$inputData = [];
|
||||||
foreach ($data as $id => $item) {
|
foreach ($data as $id => $item) {
|
||||||
if (count($item) == 1) {
|
if (count($item) == 1) {
|
||||||
|
continue;
|
||||||
$itemValues = array_values($item);
|
$itemValues = array_values($item);
|
||||||
if (isset($itemValues[0]) && count($itemValues[0]) == 1) {
|
if (isset($itemValues[0]) && count($itemValues[0]) == 1) {
|
||||||
continue;
|
continue;
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue