CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-13 18:00:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Translate all code to English (#1836)

Browse Source 
* Review the EN heading format.

* Fix pythontutor headings.

* Fix pythontutor headings.

* bug fixes

* Fix headings in **/summary.md

* Revisit the CN-to-EN translation for Python code using Claude-4.5

* Revisit the CN-to-EN translation for Java code using Claude-4.5

* Revisit the CN-to-EN translation for Cpp code using Claude-4.5.

* Fix the dictionary.

* Fix cpp code translation for the multipart strings.

* Translate Go code to English.

* Update workflows to test EN code.

* Add EN translation for C.

* Add EN translation for CSharp.

* Add EN translation for Swift.

* Trigger the CI check.

* Revert.

* Update en/hash_map.md

* Add the EN version of Dart code.

* Add the EN version of Kotlin code.

* Add missing code files.

* Add the EN version of JavaScript code.

* Add the EN version of TypeScript code.

* Fix the workflows.

* Add the EN version of Ruby code.

* Add the EN version of Rust code.

* Update the CI check for the English version  code.

* Update Python CI check.

* Fix cmakelists for en/C code.

* Fix Ruby comments
This commit is contained in:
Yudong Jin
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
en/codes/java/chapter_graph/graph_adjacency_list.java
View File

@@ -52,7 +52,7 @@ class GraphAdjList {
public void addVertex(Vertex vet) {
if (adjList.containsKey(vet))
return;
// Add a new linked list to the adjacency list
// Add a new linked list in the adjacency list
adjList.put(vet, new ArrayList<>());
}
@@ -60,15 +60,15 @@ class GraphAdjList {
public void removeVertex(Vertex vet) {
if (!adjList.containsKey(vet))
throw new IllegalArgumentException();
// Remove the vertex vet's corresponding linked list from the adjacency list
// Remove the linked list corresponding to vertex vet in the adjacency list
adjList.remove(vet);
// Traverse other vertices' linked lists, removing all edges containing vet
// Traverse the linked lists of other vertices and remove all edges containing vet
for (List<Vertex> list : adjList.values()) {
list.remove(vet);
}
}
/* Print the adjacency list */
/* Print adjacency list */
public void print() {
System.out.println("Adjacency list =");
for (Map.Entry<Vertex, List<Vertex>> pair : adjList.entrySet()) {
@@ -82,36 +82,36 @@ class GraphAdjList {
public class graph_adjacency_list {
public static void main(String[] args) {
/* Initialize undirected graph */
/* Add edge */
Vertex[] v = Vertex.valsToVets(new int[] { 1, 3, 2, 5, 4 });
Vertex[][] edges = { { v[0], v[1] }, { v[0], v[3] }, { v[1], v[2] },
{ v[2], v[3] }, { v[2], v[4] }, { v[3], v[4] } };
GraphAdjList graph = new GraphAdjList(edges);
System.out.println("\nAfter initialization, the graph is");
System.out.println("\nAfter initialization, graph is");
graph.print();
/* Add edge */
// Vertices 1, 2 i.e., v[0], v[2]
// Vertices 1, 3 are v[0], v[1]
graph.addEdge(v[0], v[2]);
System.out.println("\nAfter adding edge 1-2, the graph is");
System.out.println("\nAfter adding edge 1-2, graph is");
graph.print();
/* Remove edge */
// Vertices 1, 3 i.e., v[0], v[1]
// Vertex 3 is v[1]
graph.removeEdge(v[0], v[1]);
System.out.println("\nAfter removing edge 1-3, the graph is");
System.out.println("\nAfter removing edge 1-3, graph is");
graph.print();
/* Add vertex */
Vertex v5 = new Vertex(6);
graph.addVertex(v5);
System.out.println("\nAfter adding vertex 6, the graph is");
System.out.println("\nAfter adding vertex 6, graph is");
graph.print();
/* Remove vertex */
// Vertex 3 i.e., v[1]
// Vertex 3 is v[1]
graph.removeVertex(v[1]);
System.out.println("\nAfter removing vertex 3, the graph is");
System.out.println("\nAfter removing vertex 3, graph is");
graph.print();
}
}

40
en/codes/java/chapter_graph/graph_adjacency_matrix.java
View File

@@ -11,8 +11,8 @@ import java.util.*;
/* Undirected graph class based on adjacency matrix */
class GraphAdjMat {
List<Integer> vertices; // Vertex list, elements represent "vertex value", index represents "vertex index"
List<List<Integer>> adjMat; // Adjacency matrix, row and column indices correspond to "vertex index"
List<Integer> vertices; // Vertex list, where the element represents the "vertex value" and the index represents the "vertex index"
List<List<Integer>> adjMat; // Adjacency matrix, where the row and column indices correspond to the "vertex index"
/* Constructor */
public GraphAdjMat(int[] vertices, int[][] edges) {
@@ -23,7 +23,7 @@ class GraphAdjMat {
addVertex(val);
}
// Add edge
// Edges elements represent vertex indices
// Note that the edges elements represent vertex indices, i.e., corresponding to the vertices element indices
for (int[] e : edges) {
addEdge(e[0], e[1]);
}
@@ -37,7 +37,7 @@ class GraphAdjMat {
/* Add vertex */
public void addVertex(int val) {
int n = size();
// Add new vertex value to the vertex list
// Add the value of the new vertex to the vertex list
vertices.add(val);
// Add a row to the adjacency matrix
List<Integer> newRow = new ArrayList<>(n);
@@ -55,29 +55,29 @@ class GraphAdjMat {
public void removeVertex(int index) {
if (index >= size())
throw new IndexOutOfBoundsException();
// Remove vertex at `index` from the vertex list
// Remove the vertex at index from the vertex list
vertices.remove(index);
// Remove the row at `index` from the adjacency matrix
// Remove the row at index from the adjacency matrix
adjMat.remove(index);
// Remove the column at `index` from the adjacency matrix
// Remove the column at index from the adjacency matrix
for (List<Integer> row : adjMat) {
row.remove(index);
}
}
/* Add edge */
// Parameters i, j correspond to vertices element indices
// Parameters i, j correspond to the vertices element indices
public void addEdge(int i, int j) {
// Handle index out of bounds and equality
if (i < 0 || j < 0 || i >= size() || j >= size() || i == j)
throw new IndexOutOfBoundsException();
// In an undirected graph, the adjacency matrix is symmetric about the main diagonal, i.e., satisfies (i, j) == (j, i)
// In an undirected graph, the adjacency matrix is symmetric about the main diagonal, i.e., (i, j) == (j, i)
adjMat.get(i).set(j, 1);
adjMat.get(j).set(i, 1);
}
/* Remove edge */
// Parameters i, j correspond to vertices element indices
// Parameters i, j correspond to the vertices element indices
public void removeEdge(int i, int j) {
// Handle index out of bounds and equality
if (i < 0 || j < 0 || i >= size() || j >= size() || i == j)
@@ -97,35 +97,35 @@ class GraphAdjMat {
public class graph_adjacency_matrix {
public static void main(String[] args) {
/* Initialize undirected graph */
// Edges elements represent vertex indices
/* Add edge */
// Note that the edges elements represent vertex indices, i.e., corresponding to the vertices element indices
int[] vertices = { 1, 3, 2, 5, 4 };
int[][] edges = { { 0, 1 }, { 0, 3 }, { 1, 2 }, { 2, 3 }, { 2, 4 }, { 3, 4 } };
GraphAdjMat graph = new GraphAdjMat(vertices, edges);
System.out.println("\nAfter initialization, the graph is");
System.out.println("\nAfter initialization, graph is");
graph.print();
/* Add edge */
// Indices of vertices 1, 2 are 0, 2 respectively
// Add vertex
graph.addEdge(0, 2);
System.out.println("\nAfter adding edge 1-2, the graph is");
System.out.println("\nAfter adding edge 1-2, graph is");
graph.print();
/* Remove edge */
// Indices of vertices 1, 3 are 0, 1 respectively
// Vertices 1, 3 have indices 0, 1 respectively
graph.removeEdge(0, 1);
System.out.println("\nAfter removing edge 1-3, the graph is");
System.out.println("\nAfter removing edge 1-3, graph is");
graph.print();
/* Add vertex */
graph.addVertex(6);
System.out.println("\nAfter adding vertex 6, the graph is");
System.out.println("\nAfter adding vertex 6, graph is");
graph.print();
/* Remove vertex */
// Index of vertex 3 is 1
// Vertex 3 has index 1
graph.removeVertex(1);
System.out.println("\nAfter removing vertex 3, the graph is");
System.out.println("\nAfter removing vertex 3, graph is");
graph.print();
}
}

18
en/codes/java/chapter_graph/graph_bfs.java
View File

@@ -11,11 +11,11 @@ import utils.*;
public class graph_bfs {
/* Breadth-first traversal */
// Use adjacency list to represent the graph, to obtain all adjacent vertices of a specified vertex
// Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
static List<Vertex> graphBFS(GraphAdjList graph, Vertex startVet) {
// Vertex traversal sequence
List<Vertex> res = new ArrayList<>();
// Hash set, used to record visited vertices
// Hash set for recording vertices that have been visited
Set<Vertex> visited = new HashSet<>();
visited.add(startVet);
// Queue used to implement BFS
@@ -23,28 +23,28 @@ public class graph_bfs {
que.offer(startVet);
// Starting from vertex vet, loop until all vertices are visited
while (!que.isEmpty()) {
Vertex vet = que.poll(); // Dequeue the vertex at the head of the queue
Vertex vet = que.poll(); // Dequeue the front vertex
res.add(vet); // Record visited vertex
// Traverse all adjacent vertices of that vertex
// Traverse all adjacent vertices of this vertex
for (Vertex adjVet : graph.adjList.get(vet)) {
if (visited.contains(adjVet))
continue; // Skip already visited vertices
continue; // Skip vertices that have been visited
que.offer(adjVet); // Only enqueue unvisited vertices
visited.add(adjVet); // Mark the vertex as visited
visited.add(adjVet); // Mark this vertex as visited
}
}
// Return the vertex traversal sequence
// Return vertex traversal sequence
return res;
}
public static void main(String[] args) {
/* Initialize undirected graph */
/* Add edge */
Vertex[] v = Vertex.valsToVets(new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
Vertex[][] edges = { { v[0], v[1] }, { v[0], v[3] }, { v[1], v[2] }, { v[1], v[4] },
{ v[2], v[5] }, { v[3], v[4] }, { v[3], v[6] }, { v[4], v[5] },
{ v[4], v[7] }, { v[5], v[8] }, { v[6], v[7] }, { v[7], v[8] } };
GraphAdjList graph = new GraphAdjList(edges);
System.out.println("\nAfter initialization, the graph is");
System.out.println("\nAfter initialization, graph is");
graph.print();
/* Breadth-first traversal */

14
en/codes/java/chapter_graph/graph_dfs.java
View File

@@ -13,34 +13,34 @@ public class graph_dfs {
/* Depth-first traversal helper function */
static void dfs(GraphAdjList graph, Set<Vertex> visited, List<Vertex> res, Vertex vet) {
res.add(vet); // Record visited vertex
visited.add(vet); // Mark the vertex as visited
// Traverse all adjacent vertices of that vertex
visited.add(vet); // Mark this vertex as visited
// Traverse all adjacent vertices of this vertex
for (Vertex adjVet : graph.adjList.get(vet)) {
if (visited.contains(adjVet))
continue; // Skip already visited vertices
continue; // Skip vertices that have been visited
// Recursively visit adjacent vertices
dfs(graph, visited, res, adjVet);
}
}
/* Depth-first traversal */
// Use adjacency list to represent the graph, to obtain all adjacent vertices of a specified vertex
// Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
static List<Vertex> graphDFS(GraphAdjList graph, Vertex startVet) {
// Vertex traversal sequence
List<Vertex> res = new ArrayList<>();
// Hash set, used to record visited vertices
// Hash set for recording vertices that have been visited
Set<Vertex> visited = new HashSet<>();
dfs(graph, visited, res, startVet);
return res;
}
public static void main(String[] args) {
/* Initialize undirected graph */
/* Add edge */
Vertex[] v = Vertex.valsToVets(new int[] { 0, 1, 2, 3, 4, 5, 6 });
Vertex[][] edges = { { v[0], v[1] }, { v[0], v[3] }, { v[1], v[2] },
{ v[2], v[5] }, { v[4], v[5] }, { v[5], v[6] } };
GraphAdjList graph = new GraphAdjList(edges);
System.out.println("\nAfter initialization, the graph is");
System.out.println("\nAfter initialization, graph is");
graph.print();
/* Depth-first traversal */