|
|
@ -121,8 +121,8 @@ class UserModel
|
|
|
|
|
|
|
|
|
|
|
|
public function largest_consecutive_number($list) {
|
|
|
|
public function largest_consecutive_number($list) {
|
|
|
|
sort($list);
|
|
|
|
sort($list);
|
|
|
|
$largest = 0;
|
|
|
|
$largest = 2;
|
|
|
|
$missing = 0;
|
|
|
|
$missing = 1;
|
|
|
|
for ($i = 0; $i < count($list) - 1; $i++) {
|
|
|
|
for ($i = 0; $i < count($list) - 1; $i++) {
|
|
|
|
if ($list[$i] + 1 != $list[$i + 1]) {
|
|
|
|
if ($list[$i] + 1 != $list[$i + 1]) {
|
|
|
|
if ($list[$i] > $largest) {
|
|
|
|
if ($list[$i] > $largest) {
|
|
|
@ -152,7 +152,7 @@ class UserModel
|
|
|
|
$tempDeResolution = $interval->days * 24 * 60 * 60 + $interval->h * 60 * 60 + $interval->i * 60 + $interval->s;
|
|
|
|
$tempDeResolution = $interval->days * 24 * 60 * 60 + $interval->h * 60 * 60 + $interval->i * 60 + $interval->s;
|
|
|
|
$leClassement = $this->resoudre_gateway->getClassement($enigmeId, $idPartie);
|
|
|
|
$leClassement = $this->resoudre_gateway->getClassement($enigmeId, $idPartie);
|
|
|
|
if (empty($leClassement)){
|
|
|
|
if (empty($leClassement)){
|
|
|
|
$classement = 2;
|
|
|
|
$classement = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else{
|
|
|
|
else{
|
|
|
|
$classement = $this->largest_consecutive_number($leClassement);
|
|
|
|
$classement = $this->largest_consecutive_number($leClassement);
|
|
|
|