PHP获取数组中某元素的位置实例

<?php
$test=array(10,20,30,"10","20","30");
print_r(array_keys($test,"10",true));//严格匹配模式
//输出：
//Array ( [0] => 3)
?>

$one = array(1, 2, 3, 4);

$two = array("test1" =>array('name'=>"tank","phone"=>12412433),
 "test2"&nbsp; => array('name'=>"ying","phone"=>252523523),
 "test3" => array('name'=>"zhang","phone"=>656452345),);

foreach ($one as $k=>$v) {
 echo "key=".$k."&amp;value=".$v."&lt;br>";
}
$i=0;
foreach ($two as $k=>$v) {

 foreach($v as $value){
  if( $v='tank' )
        {
           echo $i;
         }
          $i++;
 }
}

 
<?php
$a=array(0=>"Dog",1=>"Cat",2=>"Horse",3=>"Bird");
print_r(array_slice($a,1,2));
?>

输出

Array ( [0] => Cat [1] => Horse )

$array = array('1', '2', '3', '4', '5');

$del_value = 3;
unset($array[array_search($del_value , $array)]);//利用unset删除这个元素

print_r($array);

输出

array('1', '2', '4', '5');

unset($array[3]);
unset($array['foo']);

unset($array[3] $array[5]);
unset($array['foo'] $array['bar']);

array_splice($array $offset $length);

function comparePrice($priceA, $priceB){
    return $priceA['price'] - $priceB['price'];
}

usort($games, 'comparePrice');

$iterator = new RecursiveArrayIterator($games);
iterator_apply($iterator, 'navigateArray', array($iterator));

function navigateArray($iterator) {
 while ($iterator->valid()) {
  if ($iterator->hasChildren()) {
   navigateArray($iterator->getChildren());
  } else {
   printf("%s: %s", $iterator->key(), $iterator->current());
  }
  $iterator->next();
 } 
}

function filterGames($game){
 return ($game['price'] < 11.99);
}

$names = array_filter($games, 'filterGames');

class Game {
 public $name;
 public $price;
}

$game = new Game();
$game->name = 'chess';
$game->price = 12.99;

print_r(array($game));

执行该例子就会产生如下结果：

Array
(
[0] => Game Object
  (
    [name] => chess
    [price] => 12.99
  )
)

class Game {
 public $name;
 private $_price;

 public function setPrice($price)  {
  $this->_price = $price;
 }
}

$game = new Game();
$game->name = 'chess';
$game->setPrice(12.99);

print_r(array($game));执行该代码片段：

Array
(
[0] => Game Object
  (
    [name] => chess
    [_price:Game:private] => 12.99
  )
)

$arr = array(
 0=>'madden2011.png',
 1=>'madden2011-1.png',
 2=>'madden2011-2.png',
 3=>'madden2012.png'
);

你怎样对这个数组进行排序呢？如果你用sort()对该数组排序，结果是这样的：

Array
(
    [0] => madden2011-1.png
    [1] => madden2011-2.png
    [2] => madden2011.png
    [3] => madden2012.png
)

<?php
$arr = array(
 0=>'madden2011.png',
 1=>'madden2011-1.png',
 2=>'madden2011-2.png',
 3=>'madden2012.png'
);

natsort($arr);
echo "<pre>"; print_r($arr); echo "</pre>";
?>

运行结果：

Array
(
    [1] => madden2011-1.png
    [2] => madden2011-2.png
    [0] => madden2011.png
    [3] => madden2012.png
)

<?php
$array = array("A"=>1, "B"=>1, "C"=>1, "D"=>1);
foreach($array as &amp;$value)
    $value = 2;
print_r($array);
?>

<?php
$array = array("A"=>1, "B"=>1, "C"=>1, "D"=>1);
foreach($array as $key => $value){
    if($key == "B"){
        $array["A"] = "CHANGE";
        $array["D"] = "CHANGE";
        print_r($array);
        echo '<br />';
    }
 
    if($value === "CHANGE")
        echo $value.'<br />';
}
print_r($array);
?>

<?php
$array = array("A"=>1, "B"=>1, "C"=>1, "D"=>1);
foreach($array as $key => $value){
    if($key == "B"){
        $array["A"] = "CHANGE";
        $array["D"] = "CHANGE";
        print_r($array);
        echo '<br />';
    }
   
    if($array[$key] === "CHANGE")
        echo $value.'<br />';
}
print_r($array);
?>

    <?php  
    //本代码仅仅是提供一些思路  
    //距离实际应用还有一些距离  
     $mobile = '15858588585';  
    //下面的1便是手机的第一位数字必须为数字1  
    //[0-9]指后面的数字均为0~9的数字  
    //{9}这中间的9指的是手机号码除了第一位数外，其他要重复10次，刚好就是11位数了  
    if(!preg_match('/^1([0-9]{9})/',$mobile)) exit('您的手机号码不正确');  
    ?> 

    <?php
     function checkMobile($str)
     {
         $pattern = “/^(13|15)d{9}$/”;
         if (preg_match($pattern,$str))
         {
              Return true;
         }
         else
         {
             Return false;
         }
     }
    //调用函数
    $str = checkMobile(“15800000001″);
     if($str)
     {
     echo(“符合手机号码标准”);
     }
     else
     {
     echo(“不符合手机号码标准”);
     }
    ?>

    function is_mobile($str){  
    return preg_match("/^(((d{3}))|(d{3}-))?13d{9}$/", $str);  
    } 

//冒泡法排序
//随便给出一个乱序数组
$arr = array(0,2,10,9,19,23,89,112,321,234);
//统计数组
$num = count($arr);
//冒泡倒序排列
for($i=0;$i<$num-1;$i++){
 for($m=0;$m<$num-1;$m++){
  if($arr[$m]<$arr[$m+1]){
   $temp = $arr[$m];
   $arr[$m] = $arr[$m+1];
   $arr[$m+1] = $temp;
  }
  // echo $arr[$m].'<br>';
 }
}
//输出排序后的结果
var_dump($arr);
//冒泡顺序排列
for($x=0;$x<$num-1;$x++){
 for($y=0;$y<$num-1;$y++){
  if($arr[$y]>$arr[$y+1]){
   $temp = $arr[$y];
   $arr[$y] = $arr[$y+1];
   $arr[$y+1] = $temp;
  }
 }
}
//输出排序后的结果
var_dump($arr);
//二分法查找
function dichotomy($array,$k,$low=0,$high=0){
 if(count($array)!= 0 && $high == 0){
  $high = count($array);
 }
 if($low <= $high){
  $mid = intval(($low+$high)/2);
  if( $array[$mid] == $k ){
   return $mid;
  }elseif( $k<$array[$mid]){
   return dichotomy( $array,$k,$low=0,$mid-1);
  }else{
   return dichotomy( $array,$k,$mid+1,$high);
  }
 }else{
  return false;
 }
}
//输出查找结果
echo dichotomy($arr,23);