blocks|key|1411990|text|$item=end($array);
do+{
...
}+while+($item=prev($array));|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1411991|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>$item=end($array);
do {
...
} while ($item=prev($array));
</code></pre>

blocks|key|2058908|text|$array+=+array_reverse($array);
foreach($array+as+$key+=>+$currentElement)+{}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|2058909|这是更好的使用方法。如果键不是连续的或整型的，它也会处理键。|unstyled|2058910|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|J|8|@]|9|@]|A|$]]|$1|G|3|-4|5|F|7|K|8|@]|9|@]|A|$]]]|H|$]]

<pre><code>$array = array_reverse($array);
foreach($array as $key =&gt; $currentElement) {}
</code></pre>

This is better way to use. It will take care of keys also, if they are not sequential or integer.

blocks|key|2058937|text|根据您正在尝试执行的操作，您可能希望查看spl数据结构类，例如SplStack。SplStack实现了迭代器、ArrayAccess和Countable，所以它基本上可以像数组一样使用，但默认情况下，它的迭代器是按FILO顺序进行的。例如：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2058938|$stack+=+new+SplStack();
$stack[]+=+'one';
$stack[]+=+'two';
$stack[]+=+'three';

foreach+($stack+as+$item)
{
++++print+"$item\n";
}|code-block|syntax|javascript|2058939|这将打印出来|2058940|three
two
one|2058941|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

Depending on what you are trying to do, you might want to look into the spl data structure classes, such as SplStack. SplStack implements Iterator, ArrayAccess and Countable, so it can mostly be used like an array, but by default, its iterator proceeds in FILO order. Ex:

<pre><code>$stack = new SplStack();
$stack[] = 'one';
$stack[] = 'two';
$stack[] = 'three';

foreach ($stack as $item)
{
 print "$item\n";
}
</code></pre>

This will print

<pre><code>three
two
one
</code></pre>

blocks|key|1412097|text|没有ReverseArrayIterator可以做到这一点。你可以做到|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1412098|$reverted+=+new+ArrayIterator(array_reverse($data));|code-block|syntax|javascript|1412099|或者将其添加到您自己的自定义迭代器中。|1412100|class+ReverseArrayIterator+extends+ArrayIterator+
{
++++public+function+__construct(array+$array)
++++{
++++++++parent::__construct(array_reverse($array));
++++}
}|1412101|不使用array_reverse但通过标准数组函数迭代数组的稍微长一点的实现是|1412102|class+ReverseArrayIterator+implements+Iterator
{
++++private+$array;

++++public+function+__construct(array+$array)
++++{
++++++++$this->array+=+$array;
++++}

++++public+function+current()
++++{
++++++++return+current($this->array);
++++}

++++public+function+next()
++++{
++++++++return+prev($this->array);
++++}

++++public+function+key()
++++{
++++++++return+key($this->array);
++++}

++++public+function+valid()
++++{
++++++++return+key($this->array)+!==+null;
++++}

++++public+function+rewind()
++++{
++++++++end($this->array);
++++}
}|1412103|entityMap^0|2|K|0|0|0|0|3|D|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|X|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|Y|8|@]|D|@]|E|$]]|$1|M|3|N|5|H|7|Z|8|@]|D|@]|E|$I|J]]|$1|O|3|P|5|6|7|10|8|@$9|11|A|12|B|C]]|D|@]|E|$]]|$1|Q|3|R|5|H|7|13|8|@]|D|@]|E|$I|J]]|$1|S|3|-4|5|6|7|14|8|@]|D|@]|E|$]]]|T|$]]

There is no <code>ReverseArrayIterator</code> to do that. You can do
<pre><code>$reverted = new ArrayIterator(array_reverse($data));
</code></pre>
or make that into your own custom iterator, e.g.
<pre><code>class ReverseArrayIterator extends ArrayIterator 
{
 public function __construct(array $array)
 {
 parent::__construct(array_reverse($array));
 }
}
</code></pre>
A slightly longer implementation that doesn't use <code>array_reverse</code> but iterates the array via the standard array functions would be
<pre><code>class ReverseArrayIterator implements Iterator
{
 private $array;

 public function __construct(array $array)
 {
 $this-&gt;array = $array;
 }

 public function current()
 {
 return current($this-&gt;array);
 }

 public function next()
 {
 return prev($this-&gt;array);
 }

 public function key()
 {
 return key($this-&gt;array);
 }

 public function valid()
 {
 return key($this-&gt;array) !== null;
 }

 public function rewind()
 {
 end($this-&gt;array);
 }
}
</code></pre>

blocks|key|1412124|text|请注意，如果希望保留数组的键，则必须将true作为第二个参数传递给array_reverse|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1412125|$array+=+array_reverse($array,+true);
foreach+($array+as+$currentElement)+{
++++//+do+something+here
}|code-block|syntax|javascript|1412126|entityMap^0|J|4|X|D|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]|$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|R|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|S|8|@]|D|@]|E|$]]]|L|$]]

Note that if you want to preserve the keys of the array, you must pass <code>true</code> as the second parameter to <code>array_reverse</code>:

<pre><code>$array = array_reverse($array, true);
foreach ($array as $currentElement) {
 // do something here
}
</code></pre>

blocks|key|5078811|text|这可能是一种性能更好的方法，因为它不会构造新的数组。它还可以很好地处理空数组。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5078812|$item+=+end($items);
while($item)
{
++++...do+stuff...
++++$item+=+prev($items);
}|code-block|syntax|javascript|5078813|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

This could be a more performant way since it doesnt construct a new array. It also handles empty arrays well.

<pre><code>$item = end($items);
while($item)
{
 ...do stuff...
 $item = prev($items);
}
</code></pre>

blocks|key|2056279|text|下面是一个不复制也不修改数组的解决方案：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2056280|for+(end($array);+key($array)!==null;+prev($array)){
++$currentElement+=+current($array);
++//+...
}|code-block|syntax|javascript|2056281|如果您还想引用当前键：|2056282|for+(end($array);+($currentKey=key($array))!==null;+prev($array)){
++$currentElement+=+current($array);
++//+...
}|2056283|这总是有效的，因为php数组键永远不会为空，并且比这里给出的任何其他答案都要快。|2056284|entityMap^0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Q|8|@]|9|@]|A|$]]|$1|I|3|J|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|K|3|L|5|6|7|S|8|@]|9|@]|A|$]]|$1|M|3|-4|5|6|7|T|8|@]|9|@]|A|$]]]|N|$]]

Here is a solution that does not copy and does not modify the array:

<pre><code>for (end($array); key($array)!==null; prev($array)){
 $currentElement = current($array);
 // ...
}
</code></pre>

If you also want a reference to the current key:

<pre><code>for (end($array); ($currentKey=key($array))!==null; prev($array)){
 $currentElement = current($array);
 // ...
}
</code></pre>

This works always as php array keys can never be null and is faster than any other answer given here.

blocks|key|1412264|text|$array=array(
++++0+=>+0,
++++'1'+=>+1,
++++2+=>+null,
++++3+=>+false
);

$value=end(+$array+);++++++++++++++++++++++//+←+value+for+first+iteration
while(($key=key(+$array+))+!==+null)+{
++echo+"key=$key,+value=$value\n";

++$value=prev(+$array+);+++++++++++++++++++//+←+value+for+next+iteration
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1412265|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>$array=array(
 0 =&gt; 0,
 '1' =&gt; 1,
 2 =&gt; null,
 3 =&gt; false
);

$value=end( $array ); // ← value for first iteration
while(($key=key( $array )) !== null) {
 echo "key=$key, value=$value\n";

 $value=prev( $array ); // ← value for next iteration
}
</code></pre>

blocks|key|1412293|text|$array1=数组(10，20，30，40，50)；|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1412294|++++++++for($i+=+count($array1)+-+1;+$i+>=+0;+$i--)
++++++++{
++++++++++++$array2[]++=+$array1[$i];

++++++++}

++++++++echo+"<pre>";
++++++++++++print_r($array2);
++++++++echo+"</pre>";|code-block|syntax|javascript|1412295|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

$array1= array(10,20,30,40,50);

<pre><code> for($i = count($array1) - 1; $i &gt;= 0; $i--)
 {
 $array2[] = $array1[$i];

 }

 echo "&lt;pre&gt;";
 print_r($array2);
 echo "&lt;/pre&gt;";
</code></pre>

blocks|key|2056338|text|基于linepogl's+answer，我想出了这个函数：|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2056339|/**
+*+Iterate+an+array+or+other+foreach-able+without+making+a+copy+of+it.
+*
+*+@param+array%7C\Traversable+$iterable
+*+@return+Generator
+*/
function+iter_reverse($iterable)+{
++++for+(end($iterable);+($key=key($iterable))!==null;+prev($iterable)){
++++++++yield+$key+=>+current($iterable);
++++}
}|code-block|syntax|javascript|2056340|用法：|2056341|foreach(iter_reverse($my_array)+as+$key+=>+$value)+{
++++//+...+do+things+...
}|2056342|这可以在数组和其他迭代器上工作，而不需要先复制它。|2056343|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/a/25769831/65387^0|2|H|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|11|8|@]|9|@]|C|$]]|$1|K|3|L|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|M|3|N|5|6|7|13|8|@]|9|@]|C|$]]|$1|O|3|-4|5|6|7|14|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]]]

Based on <a href="https://stackoverflow.com/a/25769831/65387">linepogl's answer</a>, I came up with this function:

<pre><code>/**
 * Iterate an array or other foreach-able without making a copy of it.
 *
 * @param array|\Traversable $iterable
 * @return Generator
 */
function iter_reverse($iterable) {
 for (end($iterable); ($key=key($iterable))!==null; prev($iterable)){
 yield $key =&gt; current($iterable);
 }
}
</code></pre>

Usage:

<pre><code>foreach(iter_reverse($my_array) as $key =&gt; $value) {
 // ... do things ...
}
</code></pre>

This works on arrays and other iterables without first making a copy of it.

blocks|key|5079027|text|基于linepogl的答案...您可以通过避免current()调用来使其更高效|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|5079028|for+($value+=+end($array);+($key+=+key($array))+!==+null;+$value+=+prev($array))+{
+++++//+...+do+something+with+$key+=>+$value
}|code-block|syntax|javascript|5079029|entityMap^0|N|9|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|P|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|Q|8|@]|D|@]|E|$]]]|L|$]]

Based on linepogl's answer... You can make it even more efficient by avoiding <code>current()</code> call

<pre><code>for ($value = end($array); ($key = key($array)) !== null; $value = prev($array)) {
 // ... do something with $key =&gt; $value
}
</code></pre>

Is there an SPL Reverse array iterator in PHP?
And if not, what would be the best way to achieve it?

I could simply do

<pre><code>$array = array_reverse($array);
foreach($array as $currentElement) {}
</code></pre>

or

<pre><code>for($i = count($array) - 1; $i &gt;= 0; $i--)
{

}
</code></pre>

But is there a more elegant way?

Iterate in reverse through an array with PHP - SPL solution?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

PHP中有SPL反转数组迭代器吗？如果没有，什么是实现它的最好方法？我可以简单的做$array = array_reverse($array);foreach($array as $currentElement) {}或for($i = count($array) - 1; $i >= 0; $i--){}但是有没有更...

问使用PHP - SPL解决方案反向迭代数组？
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用PHP - SPL解决方案反向迭代数组？EN