zoukankan      html  css  js  c++  java
  • js手风琴

    <!DOCTYPE html>
    <html lang="en">
    <head>
        <meta charset="UTF-8">
        <title>Title</title>
        <style>
            * {
                margin: 0;
                padding: 0;
                list-style: none;
            }

            #box {
                590px;
                height: 340px;
                border: #000 1px solid;
                position: relative;
                margin: 50px auto;
                overflow: hidden;
            }

            #box li {
                position: absolute;
                590px;
                height: 340px;
            }
        </style>
        <script src="move.js"></script>
        <script>
            window.onload = function () {
                var oBox = document.getElementById('box');
                var aLi = oBox.children;

                var w = 40;

                for (var i = 1; i < aLi.length; i++) {
                    aLi[i].style.left = oBox.offsetWidth - w * (aLi.length - i) + 'px';
                }

                for (var i = 0; i < aLi.length; i++) {
                    aLi[i].index = i;
                    aLi[i].onmouseover = function () {
                        for (var i = 0; i < aLi.length; i++) {
                            if (i <= this.index) {
                                move(aLi[i], {left: w * i});
                            } else {
                                move(aLi[i], {left: oBox.offsetWidth - w * (aLi.length - i)});
                            }
                        }
                    }
                }
            }
        </script>
    </head>
    <body>
    <ul id="box">
        <li style="background: pink"></li>
        <li style="background: green"></li>
        <li style="background: yellow"></li>
        <li style="background: red"></li>
        <li style="background: blue"></li>
    </ul>
    </body>
    </html>

  • 相关阅读:
    面向目标的场景设置--Goal-Oriented Scenario
    第二十二课 打造专业的编译环境(下)
    第二十一课 打造专业的编译环境(中)
    第二十课 打造专业的编译环境(上)
    第十九篇 路径搜索的综合示例
    第八十课 最长不下降序列
    第七十九课 最短路径(Floyd)
    第七十八课 最短路径(Dijkstra)
    第七十七课 最小生成树(Kruskal)
    第76课 最小生成树(Prim)
  • 原文地址:https://www.cnblogs.com/guolimin/p/6142787.html
Copyright © 2011-2022 走看看