gpt4 book ai didi

php - 用循环逻辑拆分 php

转载 作者:行者123 更新时间:2023-11-30 22:36:14 26 4
gpt4 key购买 nike

你好我有一个逻辑问题来完成我的测试这是我的数组

Array ( 
[0] => Array (
[id] => 1,
[p] => 150,
[w] => 120,
),
[1] => Array (
[id] => 2,
[p] => 10,
[w] => 20,
),
[2] => Array (
[id] => 3,
[p] => 70,
[w] => 10,
),
[3] => Array (
[id] => 4,
[p] => 100,
[w] => 45,
),
[4] => Array (
[id] => 5,
[p] => 110,
[w] => 500,
)
)

更新代码

$pt = 0;
foreach($data as $k => $plist){
$pl[] = $plist['id'];
$pt += $plist['p'];
if($pt >= 250) break;
}
// Get filter max p 250
foreach($data $k => $dat){
foreach($pl as $paa => $pat){
unset($data[$paa]); // Delete list key of Data
}
$jres[] = array("id" => $dat['id'],"p" => $dat['p'], "w" => $dat['w']);
}
// callback function and filter that will be printed only
foreach($jres as $k => $dat){
foreach($data as $paa => $pat){
unset($jres[$paa]); // Delete list key of JRES
}
}
foreach($jres as $k => $dat){
$subtotal += $dat['p'];
}
$subs = $subtotal + $pt;
end($pl);
$end = key($pl);
if($subs > 250){
unset($pl[$end]); // delete one key if total **p** sum total **price * w ** if above 250 will delete one key
}
$pack = '<table class="table">
<thead>
<h3 style="background:#D8D8D8;">Package 1</h3>
<tr>
<td class="right">P</td>
<td class="right">W</td>
</tr>
</thead><tbody>';
foreach($jres as $k => $dat){
$subtotal += $dat['p'];
$subw += $dat['w'];
$list .='<tr>
<td class="right">$'.$dat['p'].'</td>
<td class="right">'.$dat['w'].$k.' gram</td>
</tr>';
foreach($data as $dat2 => $pat){
if($k == $dat2) unset($data[$k]); // Delete key from data
}
}
$gtotal = $subw * $sfee + $subtotal;
$total = '<tr>
<th class="right" colspan="2"> Subtotal: </th>
<th class="right"> $'.$subtotal.' </th>
</tr>
<tr>
<th class="right" colspan="2">Shipping Cost ['.$subw.'g]: </th>
<th class="right"> $'.$subw * $sfee.' </th>
</tr>
<tr>
<th class="right" colspan="2"> Grandtotal: </th>
<th class="right"> $'.$gtotal.' </th>
</tr>
<tr>
<th class="right"></th>
<th class="right"></th>
</tr>
</tbody>
</table>';

目标是如何在 View 拆分中找到最小的“w”

如果总和为 250,则每个 Split View的最大值为“p”

价格 /w0.25 将与总计 p

相加

所以我尝试了一些带有循环的逻辑,但是它太复杂了而且不起作用

你能帮我写出这个逻辑吗?

我上面的代码只显示第一个 Split View。

示例输出我想要这样:

First Split
| id| w | p |
| 2| 20| 10|
| 3| 10| 70|
| 4| 45|100|
| stotal|180|
| wtotal|18.75| // $w = 20 + 10 + 45 * 0.25;
| gtotal|198.75|

SecondSplit
| id| w | p |
| 1|120|150|
| stotal|150|
| wtotal| 30| // $w = 120 * 0.25;
|Gtotal |180|

Third Split
| id| w | p |
| 5|500|110|
| stotal|110|
| wtotal|125| // $w = 500 * 0.25;
|Gtotal |235|

最佳答案

这将从您的数组中找到最低值:

<?php

$Arrays = Array (
'0' => Array (
'p' => 150,
'w' => 120,
),
'1' => Array (
'p' => 10,
'w' => 20,
),
'2' => Array (
'p' => 70,
'w' => 10,
),
'3' => Array (
'p' => 100,
'w' => 45,
),
'4' => Array (
'p' => 110,
'w' => 500,
)
);

$Encode = json_encode($Arrays);

$Decoded = json_decode($Encode);



foreach($Decoded as $Item){
$Num[] = $Item->w;

}
echo min($Num); //Will echo 10

关于php - 用循环逻辑拆分 php,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/32469439/

26 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com