mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-02 12:58:42 +08:00
Add the initial EN translation for C++ code (#1346)
This commit is contained in:
@ -48,6 +48,6 @@ public class subset_sum_i_naive {
|
||||
|
||||
System.out.println("Input array nums = " + Arrays.toString(nums) + ", target = " + target);
|
||||
System.out.println("All subsets summing to " + target + " res = " + res);
|
||||
System.out.println("Please note that the result of this method includes duplicate sets");
|
||||
System.out.println("The result of this method includes duplicate sets");
|
||||
}
|
||||
}
|
||||
|
||||
@ -23,7 +23,7 @@ class GraphAdjMat {
|
||||
addVertex(val);
|
||||
}
|
||||
// Add edge
|
||||
// Please note, edges elements represent vertex indices, corresponding to vertices elements indices
|
||||
// Edges elements represent vertex indices
|
||||
for (int[] e : edges) {
|
||||
addEdge(e[0], e[1]);
|
||||
}
|
||||
@ -98,7 +98,7 @@ class GraphAdjMat {
|
||||
public class graph_adjacency_matrix {
|
||||
public static void main(String[] args) {
|
||||
/* Initialize undirected graph */
|
||||
// Please note, edges elements represent vertex indices, corresponding to vertices elements indices
|
||||
// Edges elements represent vertex 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);
|
||||
|
||||
@ -11,7 +11,7 @@ import java.util.*;
|
||||
/* Double-linked list node */
|
||||
class ListNode {
|
||||
int val; // Node value
|
||||
ListNode next; // Reference to the next node
|
||||
ListNode next; // Reference to successor node
|
||||
ListNode prev; // Reference to predecessor node
|
||||
|
||||
ListNode(int val) {
|
||||
|
||||
Reference in New Issue
Block a user