Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commite954d6d

Browse files
committed
pt-BR translations fixes.
1 parented99f9d commite954d6d

File tree

33 files changed

+63
-93
lines changed

33 files changed

+63
-93
lines changed

‎README.pt-BR.md

Lines changed: 17 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -29,23 +29,23 @@ os dados.
2929

3030
`B` - Iniciante,`A` - Avançado
3131

32-
*`B`[Lista Encadeada (Linked List)](src/data-structures/linked-list.pt-BR)
33-
*`B`[Lista Duplamente Ligada (Doubly Linked List)](src/data-structures/doubly-linked-list.pt-BR)
34-
*`B`[Fila (Queue)](src/data-structures/queue.pt-BR)
35-
*`B`[Stack](src/data-structures/stack.pt-BR)
36-
*`B`[Tabela de Hash (Hash Table)](src/data-structures/hash-table.pt-BR)
37-
*`B`[Heap](src/data-structures/heap.pt-BR)
38-
*`B`[Fila de Prioridade (Priority Queue)](src/data-structures/priority-queue.pt-BR)
39-
*`A`[Trie](src/data-structures/trie.pt-BR)
40-
*`A`[Árvore (Tree)](src/data-structures/tree.pt-BR)
41-
*`A`[Árvore de Pesquisa Binária (Binary Search Tree)](src/data-structures/tree/binary-search-tree.pt-BR)
42-
*`A`[Árvore AVL (AVL Tree)](src/data-structures/tree/avl-tree.pt-BR)
43-
*`A`[Árvore Vermelha-Preta (Red-Black Tree)](src/data-structures/tree/red-black-tree.pt-BR)
44-
*`A`[Árvore de Segmento (Segment Tree)](src/data-structures/tree/segment-tree.pt-BR) - com exemplos de consultas min / max / sum range
45-
*`A`[Árvore Fenwick (Fenwick Tree)](src/data-structures/tree/fenwick-tree.pt-BR) (Árvore indexada binária)
46-
*`A`[Gráfico (Graph)](src/data-structures/graph.pt-BR) (ambos dirigidos e não direcionados)
47-
*`A`[Conjunto Disjuntor (Disjoint Set)](src/data-structures/disjoint-set.pt-BR)
48-
*`A`[Filtro Bloom (Bloom Filter)](src/data-structures/bloom-filter.pt-BR)
32+
*`B`[Lista Encadeada (Linked List)](src/data-structures/linked-list/README.pt-BR)
33+
*`B`[Lista Duplamente Ligada (Doubly Linked List)](src/data-structures/doubly-linked-list/README.pt-BR)
34+
*`B`[Fila (Queue)](src/data-structures/queue/README.pt-BR)
35+
*`B`[Stack](src/data-structures/stack/README.pt-BR)
36+
*`B`[Tabela de Hash (Hash Table)](src/data-structures/hash-table/README.pt-BR)
37+
*`B`[Heap](src/data-structures/heap/README.pt-BR)
38+
*`B`[Fila de Prioridade (Priority Queue)](src/data-structures/priority-queue/README.pt-BR)
39+
*`A`[Trie](src/data-structures/trie/README.pt-BR)
40+
*`A`[Árvore (Tree)](src/data-structures/tree/README.pt-BR)
41+
*`A`[Árvore de Pesquisa Binária (Binary Search Tree)](src/data-structures/tree/binary-search-tree/README.pt-BR)
42+
*`A`[Árvore AVL (AVL Tree)](src/data-structures/tree/avl-tree/README.pt-BR)
43+
*`A`[Árvore Vermelha-Preta (Red-Black Tree)](src/data-structures/tree/red-black-tree/README.pt-BR)
44+
*`A`[Árvore de Segmento (Segment Tree)](src/data-structures/tree/segment-tree/README.pt-BR) - com exemplos de consultas min / max / sum range
45+
*`A`[Árvore Fenwick (Fenwick Tree)](src/data-structures/tree/fenwick-tree/README.pt-BR) (Árvore indexada binária)
46+
*`A`[Gráfico (Graph)](src/data-structures/graph/README.pt-BR) (ambos dirigidos e não direcionados)
47+
*`A`[Conjunto Disjuntor (Disjoint Set)](src/data-structures/disjoint-set/README.pt-BR)
48+
*`A`[Filtro Bloom (Bloom Filter)](src/data-structures/bloom-filter/README.pt-BR)
4949

5050
##Algoritmos
5151

‎src/data-structures/bloom-filter/README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
#Bloom Filter
22

33
_Read this in other languages:_
4-
[_Русский_](README.ru-RU.md) |[_Português_](README.pt-BR.md)
4+
[_Русский_](README.ru-RU.md),
5+
[_Português_](README.pt-BR.md)
56

67
A**bloom filter** is a space-efficient probabilistic
78
data structure designed to test whether an element

‎src/data-structures/bloom-filter/README.pt-BR.md

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,5 @@
11
#Filtro Bloom (Bloom Filter)
22

3-
_Leia em outro idioma:_
4-
[_English_](README.md) |[_Русский_](README.ru-RU.md)
5-
63
O**bloom filter** é uma estrutura de dados probabilística
74
espaço-eficiente designada para testar se um elemento está
85
ou não presente em um conjunto de dados. Foi projetado para ser

‎src/data-structures/disjoint-set/README.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
#Disjoint Set
22

33
_Read this in other languages:_
4-
[_Русский_](README.ru-RU.md) |[_Português_](README.pt-BR.md)
4+
[_Русский_](README.ru-RU.md),
5+
[_Português_](README.pt-BR.md)
56

67

78
**Disjoint-set** data structure (also called a union–find data structure or merge–find set) is a data

‎src/data-structures/disjoint-set/README.pt-BR.md

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,5 @@
11
#Conjunto Disjuntor (Disjoint Set)
22

3-
_Leia em outro idioma:_
4-
[_English_](README.md) |[_Русский_](README.ru-RU.md)
5-
63
**Conjunto Disjuntor**
74

85
**Conjunto Disjuntor** é uma estrutura de dados (também chamado de
@@ -17,7 +14,6 @@ Além de muitos outros usos (veja a seção Applications), conjunto disjuntor
1714
desempenham um papel fundamental no algoritmo de Kruskal para encontrar a
1815
árvore geradora mínima de um gráfico (graph).
1916

20-
2117
![disjoint set](https://upload.wikimedia.org/wikipedia/commons/6/67/Dsu_disjoint_sets_init.svg)
2218

2319
*MakeSet* cria 8 singletons.

‎src/data-structures/doubly-linked-list/README.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,10 @@
11
#Doubly Linked List
22

33
_Read this in other languages:_
4-
[_Русский_](README.ru-RU.md) |[_简体中文_](README.zh-CN.md) |[_日本語_](README.ja-JP.md) |[_Português_](README.pt-BR.md)
4+
[_Русский_](README.ru-RU.md),
5+
[_简体中文_](README.zh-CN.md),
6+
[_日本語_](README.ja-JP.md),
7+
[_Português_](README.pt-BR.md)
58

69
In computer science, a**doubly linked list** is a linked data structure that
710
consists of a set of sequentially linked records called nodes. Each node contains

‎src/data-structures/doubly-linked-list/README.pt-BR.md

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,5 @@
11
#Lista Duplamente Ligada (Doubly Linked List)
22

3-
_Leia em outro idioma:_
4-
[_English_](README.md) |[_简体中文_](README.zh-CN.md) |[_Русский_](README.ru-RU.md)
5-
63
Na ciência da computação, uma**lista duplamente conectada** é uma estrutura
74
de dados vinculada que se consistem em um conjunto de registros
85
sequencialmente vinculados chamados de nós (nodes). Em cada nó contém dois

‎src/data-structures/graph/README.md

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,9 @@
11
#Graph
22

33
_Read this in other languages:_
4-
[_简体中文_](README.zh-CN.md) |[_Русский_](README.ru-RU.md) |[_Português_](README.pt-BR.md)
4+
[_简体中文_](README.zh-CN.md),
5+
[_Русский_](README.ru-RU.md),
6+
[_Português_](README.pt-BR.md)
57

68
In computer science, a**graph** is an abstract data type
79
that is meant to implement the undirected graph and

‎src/data-structures/graph/README.pt-BR.md

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,5 @@
11
#Gráfico (Graph)
22

3-
_Read this in other languages:_
4-
[_English_](README.md) |[_简体中文_](README.zh-CN.md) |[_Русский_](README.ru-RU.md)
5-
63
Na ciência da computação, um**gráfico** é uma abstração de estrutura
74
de dados que se destina a implementar os conceitos da matemática de
85
gráficos direcionados e não direcionados, especificamente o campo da

‎src/data-structures/hash-table/README.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,10 @@
11
#Hash Table
22

33
_Read this in other languages:_
4-
[_简体中文_](README.zh-CN.md) |[_Русский_](README.ru-RU.md) |[_日本語_](README.ja-JP.md) |[_Português_](README.pt-BR.md)
4+
[_简体中文_](README.zh-CN.md),
5+
[_Русский_](README.ru-RU.md),
6+
[_日本語_](README.ja-JP.md),
7+
[_Português_](README.pt-BR.md)
58

69
In computing, a**hash table** (hash map) is a data
710
structure which implements an*associative array*

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp