algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 00:01:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: fix typos (#1283)

Browse Source 
* docs: fix typos

* fix
This commit is contained in:
Lioness100
2023-02-07 08:50:28 -08:00
committed by GitHub
parent 8cd86b1eda
commit 002b10a5aa
24 changed files with 47 additions and 47 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Data-Structures/Array/LocalMaximomPoint.js
View File

@ -3,7 +3,7 @@
*
* Notes:
* - works by using divide and conquer
* - the function gets the array A with n Real numbersand returns the local max point index (if more than one exists return the first one)
* - the function gets the array A with n Real numbers and returns the local max point index (if more than one exists return the first one)
*
* @complexity: O(log(n)) (on average )
* @complexity: O(log(n)) (worst case)

6
Data-Structures/Tree/Trie.js
View File

@ -83,8 +83,8 @@ Trie.prototype.remove = function (word, count) {
if (child.count >= count) child.count -= count
else child.count = 0
// If some occurrences are left we dont delete it or else
// if the object forms some other objects prefix we dont delete it
// If some occurrences are left we don't delete it or else
// if the object forms some other objects prefix we don't delete it
// For checking an empty object
// https://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object
if (child.count <= 0 && (Object.keys(child.children).length && child.children.constructor === Object)) {
@ -110,7 +110,7 @@ Trie.prototype.contains = function (word) {
return true
}
Trie.prototype.findOccurences = function (word) {
Trie.prototype.findOccurrences = function (word) {
// find the node with given prefix
const node = this.findPrefix(word)
// No such word exists