PHP作业js php——for foreach
16lz
2021-04-27
js中for forEach和php中for foreach遍历
<?php
$nums=[1,2,3,4,5,6];
$cars=["BWM","AUDI","Volvo"];
for ($i=0; $i <count($nums) ; $i++) {
echo $nums[$i].'<br>';
}
foreach($cars as $car)
{
echo $car.'<br>';
}
echo "<hr>";
?>
<!DOCTYPE html>
<html lang="zh-CN">
<head>
<meta charset="UTF-8" />
<meta http-equiv="X-UA-Compatible" content="IE=edge" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>Document</title>
</head>
<body>
<ul class="list">
<li class="item">item1</li>
<li class="item">item2</li>
<li class="item">item3</li>
<li class="item">item4</li>
<li class="item">item5</li>
</ul>
<script>
const arrs = document.querySelectorAll(".item");
console.log(arrs);
arrs.forEach((elments) => console.log(elments));
for (let index = 0; index < arrs.length; index++) {
const element = arrs[index];
console.log(element);
}
</script>
</body>
</html>
更多相关文章
- 【php基础入门】PHP环境搭建与初识php代码书写及演示PHP和JS中遍
- Go语言基础之map
- js基础知识:JS对DOM元素的基本操作,遍历、增删改查。
- 技术问答-23 javabean创建一个二叉树,左右两个叶子节点 (1)要求每
- 2021-04-12:判断二叉树是否是搜索二叉树?
- 图 - 邻接表深度优先遍历(C语言)
- 图 -邻接表广度优先遍历(C语言)
- 图 - 邻接矩阵广度优先遍历(C语言)
- 图 - 邻接矩阵深度优先遍历(C语言)