🌐 AI搜索 & 代理 主页
Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Backtracking/AllCombinationsOfSizeK.js
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
Problem: Given two numbers, n and k, make all unique combinations of k numbers from 1 to n and in sorted order

What is combinations?
- Combinations is selecting items from a collections without considering order of selection
- Combinations is selecting items from a collections without considering the order of selection

Example:
- We have an apple, a banana, and a jackfruit
Expand Down
2 changes: 1 addition & 1 deletion Data-Structures/Array/LocalMaximomPoint.js
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
*
* Notes:
* - works by using divide and conquer
* - 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)
* - the function gets the array A with n Real numbers and returns the index of local max point (if more than one exists return the first one)
*
* @complexity: O(log(n)) (on average )
* @complexity: O(log(n)) (worst case)
Expand Down
2 changes: 1 addition & 1 deletion Data-Structures/Graph/Graph2.js
Original file line number Diff line number Diff line change
Expand Up @@ -42,7 +42,7 @@ class Graph {

// iterate over the vertices
for (const i of getKeys) {
// great the corresponding adjacency list
// get the corresponding adjacency list
// for the vertex
const getValues = this.AdjList.get(i)
let conc = ''
Expand Down