Forum PHP.pl

[PHP] pobierz, plaintext 
 
$sequence = [1,1,3,4];
    public function almostIncreasingSequence($sequence) {
	    $j = count($sequence);
	    $not_higher_than_previous = 0;
	    for($i = 0; $i < $j - 1; $i++) {
	        if ($sequence[$i] >= $sequence[($i + 1)]) {
	            $not_higher_than_previous++;
	            if ($not_higher_than_previous === 2) return FALSE;
            }
        }
 
        return $not_higher_than_previous === 1 ? TRUE : FALSE;
    }
[PHP] pobierz, plaintext 

[PHP] pobierz, plaintext 
function almostIncreasingSequence($a) {
	$bledy = 0;
	sort($a);
	foreach ($a as $biezacy) {
		if (!isset($poprzedni) || $poprzedni < $biezacy) {
			$poprzedni = $biezacy;
			continue;
		} else {
			$bledy++;
		}
		if ($bledy > 1) {
			return false;
		}
	}
	return true;
}
[PHP] pobierz, plaintext 

[PHP] pobierz, plaintext 
$sequence = [1,1,2,3];
if(count($sequence) - count(array_unique($sequence)) == 1){
    echo "mozna";
}
else{
    echo "nie mozna";
}
[PHP] pobierz, plaintext 

[PHP] pobierz, plaintext 
class Sequences {
    public function almostIncreasingSequence(array $sequence) {
        $j = count($sequence);
        for($i = 0; $i < $j; $i++) {
            $subsequence_to_check = $sequence;
            array_splice($subsequence_to_check, $i, 1);
            $is_sequence_increasing = $this->_isSequenceIncreasing($subsequence_to_check);
            if ($is_sequence_increasing === TRUE) return $i;
        }
        return FALSE;
    }
 
    private function _isSequenceIncreasing(array $sequence) {
        $j = count($sequence);
        if ($j === 0) return FALSE;
        for($i = 0; $i < $j - 1; $i++) {
            if ($sequence[$i] >= $sequence[($i + 1)]) return FALSE;
        }
        return TRUE;
    }
}
 
$sequence = new Sequences();
$result = $this->almostIncreasingSequence([1,5,2,4,3]);
 
[PHP] pobierz, plaintext 

[PHP] pobierz, plaintext 
<?php
function testAsc($array) {
    $memory=null;
    foreach($array as $member) {
        if ($memory)if($member<=$memory)return false;
        $memory=$member;
    }
    return true;
}
 
function solution($array) {
    for($i=0;$i<count($array);$i++) {
        $currentArray=array_filter($array, function($index) use($i) {
            return $i != $index;
        }, ARRAY_FILTER_USE_KEY);
        if(testAsc($currentArray)) return implode($currentArray) . "\n";
    }
    return 'nie da sie' . "\n";
}
 
echo solution([1, 2, 3, 4]);//234
echo solution([1, 7, 7, 4]);//nie da sie
echo solution([1, 7, 2, 4]);//124
[PHP] pobierz, plaintext