mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-12-26 07:01:18 +08:00
Add Portuguese.
This commit is contained in:
Oleksii Trekhleb
parent
09a354ac9b
commit
28ee030a82
@ -15,7 +15,8 @@ _Léelo en otros idiomas:_
|
||||
[_繁體中文_](README.zh-TW.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Français_](README.fr-FR.md)
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> Estamos escribiendo un libro que explicará claramente, en detalle, los principales algoritmos.
|
||||
Si desea ser notificado cuando se publique el libro "Algoritmos JavaScript
|
||||
|
||||
@ -16,7 +16,8 @@ _Lisez ceci dans d'autres langues:_
|
||||
[_繁體中文_](README.zh-TW.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Español_](README.es-ES.md)
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> Nous écrivons actuellement un livre qui expliquera clairement, en détail, les
|
||||
principaux algorithmes. Si vous souhaitez être notifié lorsque le livre
|
||||
@ -42,11 +43,11 @@ fonctions ou d'opérations pouvant être appliquées sur ces données.
|
||||
* `B` [Queue de Priorité](src/data-structures/priority-queue)
|
||||
* `A` [Trie](src/data-structures/trie)
|
||||
* `A` [Arbre](src/data-structures/tree)
|
||||
* `A` [Arbre de recherche Binaire](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [Arbre AVL](src/data-structures/tree/avl-tree)
|
||||
* `A` [Arbre Red-Black](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Arbre de Segments](src/data-structures/tree/segment-tree) - avec exemples de requêtes de type min/max/somme sur intervalles
|
||||
* `A` [Arbre de Fenwick](src/data-structures/tree/fenwick-tree) (Arbre Binaire Indexé)
|
||||
* `A` [Arbre de recherche Binaire](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [Arbre AVL](src/data-structures/tree/avl-tree)
|
||||
* `A` [Arbre Red-Black](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Arbre de Segments](src/data-structures/tree/segment-tree) - avec exemples de requêtes de type min/max/somme sur intervalles
|
||||
* `A` [Arbre de Fenwick](src/data-structures/tree/fenwick-tree) (Arbre Binaire Indexé)
|
||||
* `A` [Graphe](src/data-structures/graph) (orienté et non orienté)
|
||||
* `A` [Ensembles Disjoints](src/data-structures/disjoint-set)
|
||||
* `A` [Filtre de Bloom](src/data-structures/bloom-filter)
|
||||
|
||||
@ -14,7 +14,8 @@ _Read this in other languages:_
|
||||
[_繁體中文_](README.zh-TW.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Español_](README.es-ES.md)
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> 우리는 주요 알고리즘에 대해 더 자세한 설명을 담은 책을 제작 중입니다.
|
||||
만약 “JavaScript Algorithms” 책이 언제 출시되는지 알고 싶다면
|
||||
@ -38,11 +39,11 @@ _Read this in other languages:_
|
||||
* `B` [우선순위 큐](src/data-structures/priority-queue)
|
||||
* `A` [트라이](src/data-structures/trie)
|
||||
* `A` [트리](src/data-structures/tree)
|
||||
* `A` [이진 탐색 트리](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL 트리](src/data-structures/tree/avl-tree)
|
||||
* `A` [Red-Black 트리](src/data-structures/tree/red-black-tree)
|
||||
* `A` [세그먼트 트리](src/data-structures/tree/segment-tree) - min/max/sum range 쿼리 예제.
|
||||
* `A` [Fenwick 트리](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
|
||||
* `A` [이진 탐색 트리](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL 트리](src/data-structures/tree/avl-tree)
|
||||
* `A` [Red-Black 트리](src/data-structures/tree/red-black-tree)
|
||||
* `A` [세그먼트 트리](src/data-structures/tree/segment-tree) - min/max/sum range 쿼리 예제.
|
||||
* `A` [Fenwick 트리](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
|
||||
* `A` [그래프](src/data-structures/graph) (유방향, 무방향)
|
||||
* `A` [서로소 집합](src/data-structures/disjoint-set)
|
||||
* `A` [블룸 필터](src/data-structures/bloom-filter)
|
||||
|
||||
13
README.md
13
README.md
@ -16,7 +16,8 @@ _Read this in other languages:_
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Español_](README.es-ES.md)
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> We’re writing a book that will clearly explain, in detail, the main algorithms.
|
||||
If you’d like to be notified when the “JavaScript Algorithms” book
|
||||
@ -40,11 +41,11 @@ the data.
|
||||
* `B` [Priority Queue](src/data-structures/priority-queue)
|
||||
* `A` [Trie](src/data-structures/trie)
|
||||
* `A` [Tree](src/data-structures/tree)
|
||||
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
|
||||
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - with min/max/sum range queries examples
|
||||
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
|
||||
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
|
||||
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - with min/max/sum range queries examples
|
||||
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
|
||||
* `A` [Graph](src/data-structures/graph) (both directed and undirected)
|
||||
* `A` [Disjoint Set](src/data-structures/disjoint-set)
|
||||
* `A` [Bloom Filter](src/data-structures/bloom-filter)
|
||||
|
||||
@ -16,7 +16,8 @@ _Read this in other languages:_
|
||||
[_繁體中文_](README.zh-TW.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Español_](README.es-ES.md)
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> Jesteśmy w trakcie pisania książki, która w jasny i specyficzny sposób,
|
||||
wyjaśni główne algorytmy. Jeżeli chcesz dostać powiadomienie o tym kiedy
|
||||
@ -41,11 +42,11 @@ pomiędzy nimi, zadaniami lub działaniami, które mogą dotyczyć danych.
|
||||
* `B` [Kolejka Priorytetowa](src/data-structures/priority-queue)
|
||||
* `A` [Trie](src/data-structures/trie)
|
||||
* `A` [Drzewo](src/data-structures/tree)
|
||||
* `A` [Wyszukiwanie Binarne](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL Drzewo](src/data-structures/tree/avl-tree)
|
||||
* `A` [Drzewa czerwono-czarne](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Drzewo Segmentu](src/data-structures/tree/segment-tree) - z przykładami zapytań o min / max / sumie sum
|
||||
* `A` [Drzewo Fenwicka](src/data-structures/tree/fenwick-tree) (Drzewo Indeksowane Binarnie)
|
||||
* `A` [Wyszukiwanie Binarne](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL Drzewo](src/data-structures/tree/avl-tree)
|
||||
* `A` [Drzewa czerwono-czarne](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Drzewo Segmentu](src/data-structures/tree/segment-tree) - z przykładami zapytań o min / max / sumie sum
|
||||
* `A` [Drzewo Fenwicka](src/data-structures/tree/fenwick-tree) (Drzewo Indeksowane Binarnie)
|
||||
* `A` [Graf](src/data-structures/graph) (zarówno skierowane i nieukierunkowane)
|
||||
* `A` [Rozłączny Zestaw](src/data-structures/disjoint-set)
|
||||
* `A` [Filtr Blooma](src/data-structures/bloom-filter)
|
||||
|
||||
@ -11,13 +11,13 @@ com explicações relacionadas e links para leitura adicional (incluindo
|
||||
vídeos para YouTube)
|
||||
|
||||
_Leia isto em outros idiomas:_
|
||||
[_English_](https://github.com/trekhleb/javascript-algorithms/)
|
||||
[_简体中文_](README.zh-CN.md),
|
||||
[_繁體中文_](README.zh-TW.md),
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Español_](README.es-ES.md)
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> Nós estamos escrevendo um livro que explicará claramente, em datalhes, os principais algoritmos.
|
||||
Se você deseja ser notificado quando o livro "Algoritmos em JavaScript”
|
||||
@ -41,11 +41,11 @@ os dados.
|
||||
* `B` [Priority Queue](src/data-structures/priority-queue)
|
||||
* `A` [Trie](src/data-structures/trie)
|
||||
* `A` [Tree](src/data-structures/tree)
|
||||
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
|
||||
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - com exemplos de consultas min / max / sum range
|
||||
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Árvore indexada binária)
|
||||
* `A` [Binary Search Tree](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL Tree](src/data-structures/tree/avl-tree)
|
||||
* `A` [Red-Black Tree](src/data-structures/tree/red-black-tree)
|
||||
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - com exemplos de consultas min / max / sum range
|
||||
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Árvore indexada binária)
|
||||
* `A` [Graph](src/data-structures/graph) (ambos dirigidos e não direcionados)
|
||||
* `A` [Disjoint Set](src/data-structures/disjoint-set)
|
||||
* `A` [Bloom Filter](src/data-structures/bloom-filter)
|
||||
@ -13,7 +13,8 @@ _Read this in other languages:_
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Español_](README.es-ES.md)
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> We’re writing a book that will clearly explain, in detail, the main algorithms.
|
||||
If you’d like to be notified when the “JavaScript Algorithms” book
|
||||
@ -34,11 +35,11 @@ launches, [click here](https://upscri.be/402324/).
|
||||
* `B` [优先队列](src/data-structures/priority-queue)
|
||||
* `A` [字典树](src/data-structures/trie)
|
||||
* `A` [树](src/data-structures/tree)
|
||||
* `A` [二叉查找树](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL 树](src/data-structures/tree/avl-tree)
|
||||
* `A` [红黑树](src/data-structures/tree/red-black-tree)
|
||||
* `A` [线段树](src/data-structures/tree/segment-tree) - 使用 最小/最大/总和 范围查询示例
|
||||
* `A` [树状数组](src/data-structures/tree/fenwick-tree) (二叉索引树)
|
||||
* `A` [二叉查找树](src/data-structures/tree/binary-search-tree)
|
||||
* `A` [AVL 树](src/data-structures/tree/avl-tree)
|
||||
* `A` [红黑树](src/data-structures/tree/red-black-tree)
|
||||
* `A` [线段树](src/data-structures/tree/segment-tree) - 使用 最小/最大/总和 范围查询示例
|
||||
* `A` [树状数组](src/data-structures/tree/fenwick-tree) (二叉索引树)
|
||||
* `A` [图](src/data-structures/graph) (有向图与无向图)
|
||||
* `A` [并查集](src/data-structures/disjoint-set)
|
||||
* `A` [布隆过滤器](src/data-structures/bloom-filter)
|
||||
|
||||
@ -12,7 +12,8 @@ _Read this in other languages:_
|
||||
[_한국어_](README.ko-KR.md),
|
||||
[_Polski_](README.pl-PL.md),
|
||||
[_Français_](README.fr-FR.md),
|
||||
[_Español_](README.es-ES.md)
|
||||
[_Español_](README.es-ES.md),
|
||||
[_Português_](README.pt-BR.md)
|
||||
|
||||
> We’re writing a book that will clearly explain, in detail, the main algorithms.
|
||||
If you’d like to be notified when the “JavaScript Algorithms” book
|
||||
|
||||
Loading…
Reference in New Issue
Block a user