guanjihuan/GitHub_collection_javascript-algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix README typo ()

Browse Source
This commit is contained in:
Chao Zhang 2020-08-08 05:45:15 -04:00 committed by GitHub
parent f42433e51e
commit e54a3df231
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 2 additions and 2 deletions
src/data-structures/tree/segment-tree
README.mdREADME.pt-BR.md

2
src/data-structures/tree/segment-tree/README.md

@ -43,7 +43,7 @@ and geographic information systems.
Current implementation of Segment Tree implies that you may
pass any binary (with two input params) function to it and
thus you're able to do range query for variety of functions.
In tests you may find examples of doing `min`, `max` and `sam` range
In tests you may find examples of doing `min`, `max` and `sum` range
queries on SegmentTree.
## References

2
src/data-structures/tree/segment-tree/README.pt-BR.md

@ -39,7 +39,7 @@ A implementação atual da Árvore de Segmentos implica que você pode passar
qualquer função binária (com dois parâmetros de entradas) e então, você
será capaz de realizar consultas de intervalos para uma variedade de funções.
Nos testes você poderá encontrar exemplos realizando `min`, `max` e consultas de
intervalo `sam` na árvore segmentada (SegmentTree).
intervalo `sum` na árvore segmentada (SegmentTree).
## Referências