CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 18:31:08 +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

12
en/codes/java/chapter_searching/linear_search.java
View File

@@ -13,24 +13,24 @@ public class linear_search {
static int linearSearchArray(int[] nums, int target) {
// Traverse array
for (int i = 0; i < nums.length; i++) {
// Found the target element, thus return its index
// Found the target element, return its index
if (nums[i] == target)
return i;
}
// Did not find the target element, thus return -1
// Target element not found, return -1
return -1;
}
/* Linear search (linked list) */
static ListNode linearSearchLinkedList(ListNode head, int target) {
// Traverse the list
// Traverse the linked list
while (head != null) {
// Found the target node, return it
if (head.val == target)
return head;
head = head.next;
}
// If the target node is not found, return null
// Target node not found, return null
return null;
}
@@ -40,11 +40,11 @@ public class linear_search {
/* Perform linear search in array */
int[] nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
int index = linearSearchArray(nums, target);
System.out.println("The index of target element 3 is " + index);
System.out.println("Index of target element 3 = " + index);
/* Perform linear search in linked list */
ListNode head = ListNode.arrToLinkedList(nums);
ListNode node = linearSearchLinkedList(head, target);
System.out.println("The corresponding node object for target node value 3 is " + node);
System.out.println("Node object corresponding to target node value 3 is " + node);
}
}