gh-pages

分支 (2)

管理

管理

gh-pages

main

rust-algos
/
about-book.html

<!DOCTYPE HTML>
<html lang="zh-CN" class="sidebar-visible no-js light">
    <head>
        <!-- Book generated using mdBook -->
        <meta charset="UTF-8">
        <title>Rust算法教程 - Rust算法教程 The Algos (algorithms)</title>


        <!-- Custom HTML head -->

        <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
        <meta name="description" content="">
        <meta name="viewport" content="width=device-width, initial-scale=1">
        <meta name="theme-color" content="#ffffff" />

        <link rel="icon" href="favicon.svg">
        <link rel="shortcut icon" href="favicon.png">
        <link rel="stylesheet" href="css/variables.css">
        <link rel="stylesheet" href="css/general.css">
        <link rel="stylesheet" href="css/chrome.css">
        <link rel="stylesheet" href="css/print.css" media="print">

        <!-- Fonts -->
        <link rel="stylesheet" href="FontAwesome/css/font-awesome.css">
        <link rel="stylesheet" href="fonts/fonts.css">

        <!-- Highlight.js Stylesheets -->
        <link rel="stylesheet" href="highlight.css">
        <link rel="stylesheet" href="tomorrow-night.css">
        <link rel="stylesheet" href="ayu-highlight.css">

        <!-- Custom theme stylesheets -->

    </head>
    <body>
        <!-- Provide site root to javascript -->
        <script type="text/javascript">
            var path_to_root = "";
            var default_theme = window.matchMedia("(prefers-color-scheme: dark)").matches ? "navy" : "light";
        </script>

        <!-- Work around some values being stored in localStorage wrapped in quotes -->
        <script type="text/javascript">
            try {
                var theme = localStorage.getItem('mdbook-theme');
                var sidebar = localStorage.getItem('mdbook-sidebar');

                if (theme.startsWith('"') && theme.endsWith('"')) {
                    localStorage.setItem('mdbook-theme', theme.slice(1, theme.length - 1));
                }

                if (sidebar.startsWith('"') && sidebar.endsWith('"')) {
                    localStorage.setItem('mdbook-sidebar', sidebar.slice(1, sidebar.length - 1));
                }
            } catch (e) { }
        </script>

        <!-- Set the theme before any content is loaded, prevents flash -->
        <script type="text/javascript">
            var theme;
            try { theme = localStorage.getItem('mdbook-theme'); } catch(e) { }
            if (theme === null || theme === undefined) { theme = default_theme; }
            var html = document.querySelector('html');
            html.classList.remove('no-js')
            html.classList.remove('light')
            html.classList.add(theme);
            html.classList.add('js');
        </script>

        <!-- Hide / unhide sidebar before it is displayed -->
        <script type="text/javascript">
            var html = document.querySelector('html');
            var sidebar = 'hidden';
            if (document.body.clientWidth >= 1080) {
                try { sidebar = localStorage.getItem('mdbook-sidebar'); } catch(e) { }
                sidebar = sidebar || 'visible';
            }
            html.classList.remove('sidebar-visible');
            html.classList.add("sidebar-" + sidebar);
        </script>

        <nav id="sidebar" class="sidebar" aria-label="Table of contents">
            <div class="sidebar-scrollbox">
                <ol class="chapter"><li class="chapter-item expanded affix "><a href="about-book.html" class="active">Rust算法教程</a></li><li class="chapter-item expanded "><a href="sorting/index.html"><strong aria-hidden="true">1.</strong> 排序</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="sorting/bubble-sort.html"><strong aria-hidden="true">1.1.</strong> 冒泡排序</a></li><li class="chapter-item "><a href="sorting/bucket-sort.html"><strong aria-hidden="true">1.2.</strong> 桶排序</a></li><li class="chapter-item "><a href="sorting/cocktail-shaker-sort.html"><strong aria-hidden="true">1.3.</strong> 鸡尾酒排序</a></li><li class="chapter-item "><a href="sorting/comb-sort.html"><strong aria-hidden="true">1.4.</strong> 梳排序</a></li><li class="chapter-item "><a href="sorting/counting-sort.html"><strong aria-hidden="true">1.5.</strong> 计数排序</a></li><li class="chapter-item "><a href="sorting/gnome-sort.html"><strong aria-hidden="true">1.6.</strong> 地精排序</a></li><li class="chapter-item "><a href="sorting/heap-sort.html"><strong aria-hidden="true">1.7.</strong> 堆排序</a></li><li class="chapter-item "><a href="sorting/insertion-sort.html"><strong aria-hidden="true">1.8.</strong> 插入排序</a></li><li class="chapter-item "><a href="sorting/merge-sort.html"><strong aria-hidden="true">1.9.</strong> 归并排序</a></li><li class="chapter-item "><a href="sorting/odd-even.html"><strong aria-hidden="true">1.10.</strong> 奇偶排序</a></li><li class="chapter-item "><a href="sorting/quick-sort.html"><strong aria-hidden="true">1.11.</strong> 快速排序</a></li><li class="chapter-item "><a href="sorting/radix-sort.html"><strong aria-hidden="true">1.12.</strong> 基数排序</a></li><li class="chapter-item "><a href="sorting/selection-sort.html"><strong aria-hidden="true">1.13.</strong> 选择排序</a></li><li class="chapter-item "><a href="sorting/shell-sort.html"><strong aria-hidden="true">1.14.</strong> 希尔排序</a></li><li class="chapter-item "><a href="sorting/stooge-sort.html"><strong aria-hidden="true">1.15.</strong> 臭皮匠排序</a></li></ol></li><li class="chapter-item expanded "><a href="string/index.html"><strong aria-hidden="true">2.</strong> 字符串</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="string/reverse.html"><strong aria-hidden="true">2.1.</strong> 逆序倒转</a></li><li class="chapter-item "><a href="string/burrows-wheeler-transform.html"><strong aria-hidden="true">2.2.</strong> 数据转换算法</a></li><li class="chapter-item "><a href="string/knuth-morris-pratt.html"><strong aria-hidden="true">2.3.</strong> KMP算法</a></li><li class="chapter-item "><a href="string/manacher.html"><strong aria-hidden="true">2.4.</strong> 马拉车算法</a></li><li class="chapter-item "><a href="string/rabin-karp.html"><strong aria-hidden="true">2.5.</strong> Rabin Karp算法</a></li></ol></li><li class="chapter-item expanded "><a href="searching/index.html"><strong aria-hidden="true">3.</strong> 查找算法</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="searching/binary-search.html"><strong aria-hidden="true">3.1.</strong> 二分查找</a></li><li class="chapter-item "><a href="searching/binary-search-recursive.html"><strong aria-hidden="true">3.2.</strong> 递归二分查找</a></li><li class="chapter-item "><a href="searching/kth-smallest.html"><strong aria-hidden="true">3.3.</strong> 查找第K小的元素</a></li><li class="chapter-item "><a href="searching/linear-search.html"><strong aria-hidden="true">3.4.</strong> 线性搜索</a></li></ol></li><li class="chapter-item expanded "><a href="graph/index.html"><strong aria-hidden="true">4.</strong> 图论</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="graph/bellman-ford.html"><strong aria-hidden="true">4.1.</strong> 最短路径-Bellman Ford</a></li><li class="chapter-item "><a href="graph/dijkstra.html"><strong aria-hidden="true">4.2.</strong> 最短路径-Dijkstra</a></li><li class="chapter-item "><a href="graph/depth-first-search.html"><strong aria-hidden="true">4.3.</strong> 深度优先搜索</a></li><li class="chapter-item "><a href="graph/breadth-first-search.html"><strong aria-hidden="true">4.4.</strong> 广度优先搜索</a></li><li class="chapter-item "><a href="graph/depth-first-tic-tac-toe.html"><strong aria-hidden="true">4.5.</strong> 深度优先Tic Tac Toe</a></li><li class="chapter-item "><a href="graph/minimum-spanning-tree.html"><strong aria-hidden="true">4.6.</strong> 最小生成树</a></li><li class="chapter-item "><a href="graph/prim.html"><strong aria-hidden="true">4.7.</strong> Prim算法(最小生成树)</a></li></ol></li><li class="chapter-item expanded "><a href="dynamic-programming/index.html"><strong aria-hidden="true">5.</strong> 动态规划</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="dynamic-programming/fibonacci.html"><strong aria-hidden="true">5.1.</strong> 斐波那契(fibonacci)</a></li><li class="chapter-item "><a href="dynamic-programming/coin-change.html"><strong aria-hidden="true">5.2.</strong> 找钱(Coin change)</a></li><li class="chapter-item "><a href="dynamic-programming/edit-distance.html"><strong aria-hidden="true">5.3.</strong> 最小编辑距离(Edit distance)</a></li><li class="chapter-item "><a href="dynamic-programming/egg-dropping.html"><strong aria-hidden="true">5.4.</strong> 扔鸡蛋(Egg dropping)</a></li><li class="chapter-item "><a href="dynamic-programming/is-subsequence.html"><strong aria-hidden="true">5.5.</strong> 判断子序列</a></li><li class="chapter-item "><a href="dynamic-programming/knapsack.html"><strong aria-hidden="true">5.6.</strong> 背包问题</a></li><li class="chapter-item "><a href="dynamic-programming/longese-common-sequence.html"><strong aria-hidden="true">5.7.</strong> 最长公共子序列</a></li><li class="chapter-item "><a href="dynamic-programming/longest_continuous_increasing_subsequence.html"><strong aria-hidden="true">5.8.</strong> 最长连续递增序列</a></li><li class="chapter-item "><a href="dynamic-programming/longest-increasing-subsequence.html"><strong aria-hidden="true">5.9.</strong> 最长上升子序列</a></li><li class="chapter-item "><a href="dynamic-programming/maximal-square.html"><strong aria-hidden="true">5.10.</strong> 最大正方形</a></li><li class="chapter-item "><a href="dynamic-programming/maximal-subarray.html"><strong aria-hidden="true">5.11.</strong> 最大子数组</a></li><li class="chapter-item "><a href="dynamic-programming/rod-cutting.html"><strong aria-hidden="true">5.12.</strong> 棒的切割</a></li></ol></li><li class="chapter-item expanded "><div><strong aria-hidden="true">6.</strong> 数学</div><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="math/extended-euclidean.html"><strong aria-hidden="true">6.1.</strong> 扩展欧几里得算法</a></li><li class="chapter-item "><a href="math/greatest-common-divisor.html"><strong aria-hidden="true">6.2.</strong> 最大公约数</a></li><li class="chapter-item "><a href="math/pascal-triange.html"><strong aria-hidden="true">6.3.</strong> 帕斯卡三角</a></li><li class="chapter-item "><a href="math/perfect-numbers.html"><strong aria-hidden="true">6.4.</strong> 寻找完美数</a></li><li class="chapter-item "><a href="math/prime-check.html"><strong aria-hidden="true">6.5.</strong> 质数检测</a></li><li class="chapter-item "><a href="math/prime-numbers.html"><strong aria-hidden="true">6.6.</strong> 质数筛法</a></li><li class="chapter-item "><a href="math/trial-division.html"><strong aria-hidden="true">6.7.</strong> 试除法</a></li></ol></li><li class="chapter-item expanded "><div><strong aria-hidden="true">7.</strong> 几何</div><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="geometry/closet-points.html"><strong aria-hidden="true">7.1.</strong> 最近点算法</a></li></ol></li><li class="chapter-item expanded "><a href="cipher/index.html"><strong aria-hidden="true">8.</strong> 加密算法</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="cipher/caesar.html"><strong aria-hidden="true">8.1.</strong> 凯撒算法(caesar)</a></li><li class="chapter-item "><a href="cipher/morse-code.html"><strong aria-hidden="true">8.2.</strong> 摩斯码</a></li><li class="chapter-item "><a href="cipher/polibius.html"><strong aria-hidden="true">8.3.</strong> Polibius密码</a></li><li class="chapter-item "><a href="cipher/rot13.html"><strong aria-hidden="true">8.4.</strong> rot13加密算法</a></li><li class="chapter-item "><a href="cipher/another-rot13.html"><strong aria-hidden="true">8.5.</strong> rot13第二种实现</a></li><li class="chapter-item "><a href="cipher/sha256.html"><strong aria-hidden="true">8.6.</strong> sha256加密</a></li><li class="chapter-item "><a href="cipher/vigenere.html"><strong aria-hidden="true">8.7.</strong> vigenere加密</a></li><li class="chapter-item "><a href="cipher/xor.html"><strong aria-hidden="true">8.8.</strong> xor</a></li></ol></li><li class="chapter-item expanded "><div><strong aria-hidden="true">9.</strong> 其它算法</div><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="general/convex-hull.html"><strong aria-hidden="true">9.1.</strong> 凸包算法</a></li><li class="chapter-item "><a href="general/hanoi.html"><strong aria-hidden="true">9.2.</strong> 汉诺塔算法</a></li><li class="chapter-item "><a href="general/kmeans.html"><strong aria-hidden="true">9.3.</strong> K-Means算法</a></li><li class="chapter-item "><a href="general/nqueens.html"><strong aria-hidden="true">9.4.</strong> N皇后算法</a></li><li class="chapter-item "><a href="general/two-sum.html"><strong aria-hidden="true">9.5.</strong> 两数之和</a></li></ol></li><li class="chapter-item expanded "><a href="data-structures/index.html"><strong aria-hidden="true">10.</strong> 数据结构</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="data-structures/b-tree.html"><strong aria-hidden="true">10.1.</strong> B树</a></li><li class="chapter-item "><a href="data-structures/binary-search-tree.html"><strong aria-hidden="true">10.2.</strong> 二叉树</a></li><li class="chapter-item "><a href="data-structures/avl-tree.html"><strong aria-hidden="true">10.3.</strong> avl树</a></li><li class="chapter-item "><a href="data-structures/linked-list.html"><strong aria-hidden="true">10.4.</strong> 链表</a></li><li class="chapter-item "><a href="data-structures/heap.html"><strong aria-hidden="true">10.5.</strong> 堆(Heap)</a></li><li class="chapter-item "><a href="data-structures/stack.html"><strong aria-hidden="true">10.6.</strong> 栈</a></li><li class="chapter-item "><a href="data-structures/queue.html"><strong aria-hidden="true">10.7.</strong> 队列</a></li><li class="chapter-item "><a href="data-structures/trie.html"><strong aria-hidden="true">10.8.</strong> trie(字典树)</a></li><li class="chapter-item "><a href="data-structures/graph.html"><strong aria-hidden="true">10.9.</strong> 图(graph)</a></li></ol></li><li class="chapter-item expanded "><a href="leetcode/index.html"><strong aria-hidden="true">11.</strong> LeetCode题解</a><a class="toggle"><div>❱</div></a></li><li><ol class="section"><li class="chapter-item "><a href="leetcode/001-two-sum.html"><strong aria-hidden="true">11.1.</strong> 1.两数之和</a></li></ol></li></ol>
            </div>
            <div id="sidebar-resize-handle" class="sidebar-resize-handle"></div>
        </nav>

        <div id="page-wrapper" class="page-wrapper">

            <div class="page">
                <div id="menu-bar-hover-placeholder"></div>
                <div id="menu-bar" class="menu-bar sticky bordered">
                    <div class="left-buttons">
                        <button id="sidebar-toggle" class="icon-button" type="button" title="Toggle Table of Contents" aria-label="Toggle Table of Contents" aria-controls="sidebar">
                            <i class="fa fa-bars"></i>
                        </button>
                        <button id="theme-toggle" class="icon-button" type="button" title="Change theme" aria-label="Change theme" aria-haspopup="true" aria-expanded="false" aria-controls="theme-list">
                            <i class="fa fa-paint-brush"></i>
                        </button>
                        <ul id="theme-list" class="theme-popup" aria-label="Themes" role="menu">
                            <li role="none"><button role="menuitem" class="theme" id="light">Light (default)</button></li>
                            <li role="none"><button role="menuitem" class="theme" id="rust">Rust</button></li>
                            <li role="none"><button role="menuitem" class="theme" id="coal">Coal</button></li>
                            <li role="none"><button role="menuitem" class="theme" id="navy">Navy</button></li>
                            <li role="none"><button role="menuitem" class="theme" id="ayu">Ayu</button></li>
                        </ul>
                        <button id="search-toggle" class="icon-button" type="button" title="Search. (Shortkey: s)" aria-label="Toggle Searchbar" aria-expanded="false" aria-keyshortcuts="S" aria-controls="searchbar">
                            <i class="fa fa-search"></i>
                        </button>
                    </div>

                    <h1 class="menu-title">Rust算法教程 The Algos (algorithms)</h1>

                    <div class="right-buttons">
                        <a href="print.html" title="Print this book" aria-label="Print this book">
                            <i id="print-button" class="fa fa-print"></i>
                        </a>
                        <a href="https://github.com/course-rs/algos" title="Git repository" aria-label="Git repository">
                            <i id="git-repository-button" class="fa fa-github"></i>
                        </a>
                        <a href="https://github.com/course-rs/algos/blob/main/src/about-book.md" title="Suggest an edit" aria-label="Suggest an edit">
                            <i id="git-edit-button" class="fa fa-edit"></i>
                        </a>

                    </div>
                </div>

                <div id="search-wrapper" class="hidden">
                    <form id="searchbar-outer" class="searchbar-outer">
                        <input type="search" id="searchbar" name="searchbar" placeholder="Search this book ..." aria-controls="searchresults-outer" aria-describedby="searchresults-header">
                    </form>
                    <div id="searchresults-outer" class="searchresults-outer hidden">
                        <div id="searchresults-header" class="searchresults-header"></div>
                        <ul id="searchresults">
                        </ul>
                    </div>
                </div>

                <!-- Apply ARIA attributes after the sidebar and the sidebar toggle button are added to the DOM -->
                <script type="text/javascript">
                    document.getElementById('sidebar-toggle').setAttribute('aria-expanded', sidebar === 'visible');
                    document.getElementById('sidebar').setAttribute('aria-hidden', sidebar !== 'visible');
                    Array.from(document.querySelectorAll('#sidebar a')).forEach(function(link) {
                        link.setAttribute('tabIndex', sidebar === 'visible' ? 0 : -1);
                    });
                </script>

                <div id="content" class="content">
                    <main>
                        <h2 id="algos算法教程"><a class="header" href="#algos算法教程">Algos算法教程</a></h2>
<p>Rust作为一门现代化的系统编程语言，拥有与C/C++类似的性能，同时又能做非常底层的性能优化，因此非常适合写算法和leetcode。</p>
<p>Algos 算法教程涵盖了各种常用算法和数据结构的代码实现，以及leetcode题解，同时对于相关算法还提供了中文文档和注释，可以帮助大家更好、更快的学习。</p>
<h2 id="关于算法"><a class="header" href="#关于算法">关于算法</a></h2>
<p>算法，一个高大上的词汇，在计算机领域也绝对是凡人的禁忌，但是其实算法又没那么神秘，我们在写代码时，无时无刻都在与算法打交道，只是绝大部分算法我们无法感知到而已，因为这些算法已经很好的被包装在其它库中，我们只需要输入数据然后调用它获得输出数据即可，因此这就引出了算法的基本定义：</p>
<p>计算机算法是以一步接一步的方式来详细描述计算机如何将输入转化为所要求的输出的过程，或者说，算法是对计算机上执行的计算过程的具体描述。（以上内容摘抄自百度百科），简单点说计算机算法就是将输入转化为所要求的输出过程。</p>
<p>既然只要调用别人的算法库即可完成任务，我们为什么要学习算法呢？原因很简单：面试需要。哈哈，开个玩笑，当然面试很重要，但是提升自己的能力也很重要，学习算法往往能提升我们对于代码的深层次理解和认识，你会知道为何要优化代码，该如何优化代码，甚至在真的需要你手撸算法时，心中也有一个明确的思路：我该选择哪个算法，而不是一片茫然，只知道用遍历的方式来完成任务。</p>
<p>所以现在开始我们的算法之旅吧， 本章重点呈现各种常用算法的Rust实现，大部分章节都会链接一篇讲解该算法的文章。</p>
<h2 id="rust-语言学习"><a class="header" href="#rust-语言学习">Rust 语言学习</a></h2>
<p>如果大家熟悉算法，但是对于 Rust 语言还不够熟悉，可以看看 <a href="https://github.com/sunface/rust-course">Rust语言圣经</a>，它绝对是目前最优秀的 Rust 中文开源教程。</p>
<h2 id="社区贡献者"><a class="header" href="#社区贡献者">社区贡献者</a></h2>
<p>我们深知自身水平的局限性，因此非常欢迎各路大神加入进来，共同打造这门未来可以在中国乃至全世界都排得上号的算法教程！</p>

                    </main>

                    <nav class="nav-wrapper" aria-label="Page navigation">
                        <!-- Mobile navigation buttons -->

                            <a rel="next" href="sorting/index.html" class="mobile-nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
                                <i class="fa fa-angle-right"></i>
                            </a>

                        <div style="clear: both"></div>
                    </nav>
                </div>
            </div>

            <nav class="nav-wide-wrapper" aria-label="Page navigation">

                    <a rel="next" href="sorting/index.html" class="nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
                        <i class="fa fa-angle-right"></i>
                    </a>
            </nav>

        </div>


        <script type="text/javascript">
            window.playground_copyable = true;
        </script>


        <script src="elasticlunr.min.js" type="text/javascript" charset="utf-8"></script>
        <script src="mark.min.js" type="text/javascript" charset="utf-8"></script>
        <script src="searcher.js" type="text/javascript" charset="utf-8"></script>

        <script src="clipboard.min.js" type="text/javascript" charset="utf-8"></script>
        <script src="highlight.js" type="text/javascript" charset="utf-8"></script>
        <script src="book.js" type="text/javascript" charset="utf-8"></script>

        <!-- Custom JS scripts -->


    </body>
</html>