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

Fomrat the JS and TS codes with prettier.

Browse Source
This commit is contained in:
krahets
2023-04-17 21:58:11 +08:00
parent 9a98ff8a5e
commit c4ea4e39f3
68 changed files with 634 additions and 510 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/javascript/chapter_searching/hashing_search.js
View File

@@ -4,7 +4,7 @@
* Author: Zhuo Qinyue (1403450829@qq.com)
*/
const { arrToLinkedList } = require("../modules/ListNode");
const { arrToLinkedList } = require('../modules/ListNode');
/* 哈希查找（数组） */
function hashingSearchArray(map, target) {
@@ -28,18 +28,18 @@ 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: 索引
map.set(nums[i], i); // key: 元素，value: 索引
}
const index = hashingSearchArray(map, target);
console.log("目标元素 3 的索引 = " + index);
console.log('目标元素 3 的索引 = ' + index);
/* 哈希查找（链表） */
let head = arrToLinkedList(nums)
let head = arrToLinkedList(nums);
// 初始化哈希表
const map1 = new Map();
while (head != null) {
map1.set(head.val, head); // key: 节点值，value: 节点
map1.set(head.val, head); // key: 节点值，value: 节点
head = head.next;
}
const node = hashingSearchLinkedList(map1, target);
console.log("目标节点值 3 的对应节点对象为", node);
console.log('目标节点值 3 的对应节点对象为', node);

7
codes/javascript/chapter_searching/leetcode_two_sum.js
View File

@@ -35,11 +35,12 @@ function twoSumHashTable(nums, target) {
/* Driver Code */
// 方法一
const nums = [2, 7, 11, 15], target = 9;
const nums = [2, 7, 11, 15],
target = 9;
let res = twoSumBruteForce(nums, target);
console.log("方法一 res = ", res);
console.log('方法一 res = ', res);
// 方法二
res = twoSumHashTable(nums, target);
console.log("方法二 res = ", res);
console.log('方法二 res = ', res);

12
codes/javascript/chapter_searching/linear_search.js
View File

@@ -4,7 +4,7 @@
* Author: JoseHung (szhong@link.cuhk.edu.hk)
*/
const { ListNode, arrToLinkedList } = require("../modules/ListNode");
const { ListNode, arrToLinkedList } = require('../modules/ListNode');
/* 线性查找（数组） */
function linearSearchArray(nums, target) {
@@ -16,15 +16,15 @@ function linearSearchArray(nums, target) {
}
}
// 未找到目标元素，返回 -1
return -1;
return -1;
}
/* 线性查找（链表）*/
function linearSearchLinkedList(head, target) {
// 遍历链表
while(head) {
while (head) {
// 找到目标节点，返回之
if(head.val === target) {
if (head.val === target) {
return head;
}
head = head.next;
@@ -39,9 +39,9 @@ const target = 3;
/* 在数组中执行线性查找 */
const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
const index = linearSearchArray(nums, target);
console.log("目标元素 3 的索引 = " + index);
console.log('目标元素 3 的索引 = ' + index);
/* 在链表中执行线性查找 */
const head = arrToLinkedList(nums);
const node = linearSearchLinkedList(head, target);
console.log("目标节点值 3 的对应节点对象为 ", node);
console.log('目标节点值 3 的对应节点对象为 ', node);