xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-10 22:46:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update the coding style for JavaScript (#329)

Browse Source 
* Fix bug before commit 5eae708

* Update queue.md

* Update the coding style for JavaScript

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Justin Tse
2023-02-05 15:40:30 +08:00
committed by GitHub
parent 6778557056
commit 6ad8a66a7c
8 changed files with 82 additions and 87 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/javascript/chapter_searching/hashing_search.js
+21 -27
View File
@@ -4,9 +4,7 @@
* Author: Zhuo Qinyue (1403450829@qq.com)
*/
const PrintUtil = require("../include/PrintUtil");
const ListNode = require("../include/ListNode");
const { ListNode, arrToLinkedList } = require("../include/ListNode");
/* 哈希查找（数组） */
function hashingSearchArray(map, target) {
@@ -22,30 +20,26 @@ function hashingSearchLinkedList(map, target) {
return map.has(target) ? map.get(target) : null;
}
function main() {
const target = 3;
/* Driver Code */
const target = 3;
/* 哈希查找（数组） */
const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
// 初始化哈希表
const map = new Map();
for (let i = 0; i < nums.length; i++) {
map.set(nums[i], i); // key: 元素，value: 索引
}
const index = hashingSearchArray(map, target);
console.log("目标元素 3 的索引 = " + index);
/* 哈希查找（链表） */
let head = new ListNode().arrToLinkedList(nums)
// 初始化哈希表
const map1 = new Map();
while (head != null) {
map1.set(head.val, head); // key: 结点值，value: 结点
head = head.next;
}
const node = hashingSearchLinkedList(map1, target);
console.log("目标结点值 3 的对应结点对象为" );
PrintUtil.printLinkedList(node);
/* 哈希查找（数组） */
const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
// 初始化哈希表
const map = new Map();
for (let i = 0; i < nums.length; i++) {
map.set(nums[i], i); // key: 元素，value: 索引
}
const index = hashingSearch(map, target);
console.log("目标元素 3 的索引 = " + index);
main();
/* 哈希查找（链表） */
let head = arrToLinkedList(nums)
// 初始化哈希表
const map1 = new Map();
while (head != null) {
map1.set(head.val, head); // key: 结点值，value: 结点
head = head.next;
}
const node = hashingSearch1(map1, target);
console.log("目标结点值 3 的对应结点对象为", node);
codes/javascript/chapter_searching/linear_search.js
+7 -8
View File
@@ -4,7 +4,7 @@
* Author: JoseHung (szhong@link.cuhk.edu.hk)
*/
const ListNode = require("../include/ListNode");
const { ListNode, arrToLinkedList } = require("../include/ListNode");
/* 线性查找（数组） */
function linearSearchArray(nums, target) {
@@ -34,15 +34,14 @@ function linearSearchLinkedList(head, target) {
}
/* Driver Code */
var target = 3;
const target = 3;
/* 在数组中执行线性查找 */
var nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
var index = linearSearchArray(nums, target);
const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
const index = linearSearchArray(nums, target);
console.log("目标元素 3 的索引 = " + index);
/* 在链表中执行线性查找 */
var linkedList = new ListNode();
var head = linkedList.arrToLinkedList(nums);
var node = linearSearchLinkedList(head, target);
console.log("目标结点值 3 的对应结点对象为 " + node);
const head = arrToLinkedList(nums);
const node = linearSearchLinkedList(head, target);
console.log("目标结点值 3 的对应结点对象为 ", node);