mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-24 02:21:30 +08:00
feat: Traditional Chinese version (#1163)
* First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology. * Update terminology * 构造函数/构造方法 -> 建構子 异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統 斐波那契數列 -> 費波那契數列 運算元量 -> 運算量 引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向 歸併排序 -> 合併排序 范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示 反碼 -> 一補數 補碼 -> 二補數 列列尾部 -> 佇列尾部 區域性性 -> 區域性 一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號 推匯 -> 推導 * Sync with main branch * First commit * Update mkdocs.yml * Translate all the docs to traditional Chinese * Translate the code files. * Translate the docker file * Fix mkdocs.yml * Translate all the figures from SC to TC * 二叉搜尋樹 -> 二元搜尋樹 * Update terminology * 构造函数/构造方法 -> 建構子 异或 -> 互斥或 * 擴充套件 -> 擴展 * constant - 常量 - 常數 * 類 -> 類別 * AVL -> AVL 樹 * 數組 -> 陣列 * 係統 -> 系統 斐波那契數列 -> 費波那契數列 運算元量 -> 運算量 引數 -> 參數 * 聯絡 -> 關聯 * 麵試 -> 面試 * 面向物件 -> 物件導向 歸併排序 -> 合併排序 范式 -> 範式 * Fix 算法 -> 演算法 * 錶示 -> 表示 反碼 -> 一補數 補碼 -> 二補數 列列尾部 -> 佇列尾部 區域性性 -> 區域性 一摞 -> 一疊 * Synchronize with main branch * 賬號 -> 帳號 推匯 -> 推導 * Sync with main branch * Update terminology.md * 操作数量（num. of operations）-> 操作數量 * 字首和->前綴和 * Update figures * 歸 -> 迴 記憶體洩漏 -> 記憶體流失 * Fix the bug of the file filter * 支援 -> 支持 Add zh-Hant/README.md * Add the zh-Hant chapter covers. Bug fixes. * 外掛 -> 擴充功能 * Add the landing page for zh-Hant version * Unify the font of the chapter covers for the zh, en, and zh-Hant version * Move zh-Hant/ to zh-hant/ * Translate terminology.md to traditional Chinese
This commit is contained in:
Yudong Jin
128
zh-hant/codes/javascript/chapter_hashing/array_hash_map.js
Normal file
128
zh-hant/codes/javascript/chapter_hashing/array_hash_map.js
Normal file
@@ -0,0 +1,128 @@
|
||||
/**
|
||||
* File: array_hash_map.js
|
||||
* Created Time: 2022-12-26
|
||||
* Author: Justin (xiefahit@gmail.com)
|
||||
*/
|
||||
|
||||
/* 鍵值對 Number -> String */
|
||||
class Pair {
|
||||
constructor(key, val) {
|
||||
this.key = key;
|
||||
this.val = val;
|
||||
}
|
||||
}
|
||||
|
||||
/* 基於陣列實現的雜湊表 */
|
||||
class ArrayHashMap {
|
||||
#buckets;
|
||||
constructor() {
|
||||
// 初始化陣列，包含 100 個桶
|
||||
this.#buckets = new Array(100).fill(null);
|
||||
}
|
||||
|
||||
/* 雜湊函式 */
|
||||
#hashFunc(key) {
|
||||
return key % 100;
|
||||
}
|
||||
|
||||
/* 查詢操作 */
|
||||
get(key) {
|
||||
let index = this.#hashFunc(key);
|
||||
let pair = this.#buckets[index];
|
||||
if (pair === null) return null;
|
||||
return pair.val;
|
||||
}
|
||||
|
||||
/* 新增操作 */
|
||||
set(key, val) {
|
||||
let index = this.#hashFunc(key);
|
||||
this.#buckets[index] = new Pair(key, val);
|
||||
}
|
||||
|
||||
/* 刪除操作 */
|
||||
delete(key) {
|
||||
let index = this.#hashFunc(key);
|
||||
// 置為 null ，代表刪除
|
||||
this.#buckets[index] = null;
|
||||
}
|
||||
|
||||
/* 獲取所有鍵值對 */
|
||||
entries() {
|
||||
let arr = [];
|
||||
for (let i = 0; i < this.#buckets.length; i++) {
|
||||
if (this.#buckets[i]) {
|
||||
arr.push(this.#buckets[i]);
|
||||
}
|
||||
}
|
||||
return arr;
|
||||
}
|
||||
|
||||
/* 獲取所有鍵 */
|
||||
keys() {
|
||||
let arr = [];
|
||||
for (let i = 0; i < this.#buckets.length; i++) {
|
||||
if (this.#buckets[i]) {
|
||||
arr.push(this.#buckets[i].key);
|
||||
}
|
||||
}
|
||||
return arr;
|
||||
}
|
||||
|
||||
/* 獲取所有值 */
|
||||
values() {
|
||||
let arr = [];
|
||||
for (let i = 0; i < this.#buckets.length; i++) {
|
||||
if (this.#buckets[i]) {
|
||||
arr.push(this.#buckets[i].val);
|
||||
}
|
||||
}
|
||||
return arr;
|
||||
}
|
||||
|
||||
/* 列印雜湊表 */
|
||||
print() {
|
||||
let pairSet = this.entries();
|
||||
for (const pair of pairSet) {
|
||||
console.info(`${pair.key} -> ${pair.val}`);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
/* 初始化雜湊表 */
|
||||
const map = new ArrayHashMap();
|
||||
/* 新增操作 */
|
||||
// 在雜湊表中新增鍵值對 (key, value)
|
||||
map.set(12836, '小哈');
|
||||
map.set(15937, '小囉');
|
||||
map.set(16750, '小算');
|
||||
map.set(13276, '小法');
|
||||
map.set(10583, '小鴨');
|
||||
console.info('\n新增完成後，雜湊表為\nKey -> Value');
|
||||
map.print();
|
||||
|
||||
/* 查詢操作 */
|
||||
// 向雜湊表中輸入鍵 key ，得到值 value
|
||||
let name = map.get(15937);
|
||||
console.info('\n輸入學號 15937 ，查詢到姓名 ' + name);
|
||||
|
||||
/* 刪除操作 */
|
||||
// 在雜湊表中刪除鍵值對 (key, value)
|
||||
map.delete(10583);
|
||||
console.info('\n刪除 10583 後，雜湊表為\nKey -> Value');
|
||||
map.print();
|
||||
|
||||
/* 走訪雜湊表 */
|
||||
console.info('\n走訪鍵值對 Key->Value');
|
||||
for (const pair of map.entries()) {
|
||||
if (!pair) continue;
|
||||
console.info(pair.key + ' -> ' + pair.val);
|
||||
}
|
||||
console.info('\n單獨走訪鍵 Key');
|
||||
for (const key of map.keys()) {
|
||||
console.info(key);
|
||||
}
|
||||
console.info('\n單獨走訪值 Value');
|
||||
for (const val of map.values()) {
|
||||
console.info(val);
|
||||
}
|
||||
44
zh-hant/codes/javascript/chapter_hashing/hash_map.js
Normal file
44
zh-hant/codes/javascript/chapter_hashing/hash_map.js
Normal file
@@ -0,0 +1,44 @@
|
||||
/**
|
||||
* File: hash_map.js
|
||||
* Created Time: 2022-12-26
|
||||
* Author: Justin (xiefahit@gmail.com)
|
||||
*/
|
||||
|
||||
/* Driver Code */
|
||||
/* 初始化雜湊表 */
|
||||
const map = new Map();
|
||||
|
||||
/* 新增操作 */
|
||||
// 在雜湊表中新增鍵值對 (key, value)
|
||||
map.set(12836, '小哈');
|
||||
map.set(15937, '小囉');
|
||||
map.set(16750, '小算');
|
||||
map.set(13276, '小法');
|
||||
map.set(10583, '小鴨');
|
||||
console.info('\n新增完成後，雜湊表為\nKey -> Value');
|
||||
console.info(map);
|
||||
|
||||
/* 查詢操作 */
|
||||
// 向雜湊表中輸入鍵 key ，得到值 value
|
||||
let name = map.get(15937);
|
||||
console.info('\n輸入學號 15937 ，查詢到姓名 ' + name);
|
||||
|
||||
/* 刪除操作 */
|
||||
// 在雜湊表中刪除鍵值對 (key, value)
|
||||
map.delete(10583);
|
||||
console.info('\n刪除 10583 後，雜湊表為\nKey -> Value');
|
||||
console.info(map);
|
||||
|
||||
/* 走訪雜湊表 */
|
||||
console.info('\n走訪鍵值對 Key->Value');
|
||||
for (const [k, v] of map.entries()) {
|
||||
console.info(k + ' -> ' + v);
|
||||
}
|
||||
console.info('\n單獨走訪鍵 Key');
|
||||
for (const k of map.keys()) {
|
||||
console.info(k);
|
||||
}
|
||||
console.info('\n單獨走訪值 Value');
|
||||
for (const v of map.values()) {
|
||||
console.info(v);
|
||||
}
|
||||
142
zh-hant/codes/javascript/chapter_hashing/hash_map_chaining.js
Normal file
142
zh-hant/codes/javascript/chapter_hashing/hash_map_chaining.js
Normal file
@@ -0,0 +1,142 @@
|
||||
/**
|
||||
* File: hash_map_chaining.js
|
||||
* Created Time: 2023-08-06
|
||||
* Author: yuan0221 (yl1452491917@gmail.com)
|
||||
*/
|
||||
|
||||
/* 鍵值對 Number -> String */
|
||||
class Pair {
|
||||
constructor(key, val) {
|
||||
this.key = key;
|
||||
this.val = val;
|
||||
}
|
||||
}
|
||||
|
||||
/* 鏈式位址雜湊表 */
|
||||
class HashMapChaining {
|
||||
#size; // 鍵值對數量
|
||||
#capacity; // 雜湊表容量
|
||||
#loadThres; // 觸發擴容的負載因子閾值
|
||||
#extendRatio; // 擴容倍數
|
||||
#buckets; // 桶陣列
|
||||
|
||||
/* 建構子 */
|
||||
constructor() {
|
||||
this.#size = 0;
|
||||
this.#capacity = 4;
|
||||
this.#loadThres = 2.0 / 3.0;
|
||||
this.#extendRatio = 2;
|
||||
this.#buckets = new Array(this.#capacity).fill(null).map((x) => []);
|
||||
}
|
||||
|
||||
/* 雜湊函式 */
|
||||
#hashFunc(key) {
|
||||
return key % this.#capacity;
|
||||
}
|
||||
|
||||
/* 負載因子 */
|
||||
#loadFactor() {
|
||||
return this.#size / this.#capacity;
|
||||
}
|
||||
|
||||
/* 查詢操作 */
|
||||
get(key) {
|
||||
const index = this.#hashFunc(key);
|
||||
const bucket = this.#buckets[index];
|
||||
// 走訪桶，若找到 key ，則返回對應 val
|
||||
for (const pair of bucket) {
|
||||
if (pair.key === key) {
|
||||
return pair.val;
|
||||
}
|
||||
}
|
||||
// 若未找到 key ，則返回 null
|
||||
return null;
|
||||
}
|
||||
|
||||
/* 新增操作 */
|
||||
put(key, val) {
|
||||
// 當負載因子超過閾值時，執行擴容
|
||||
if (this.#loadFactor() > this.#loadThres) {
|
||||
this.#extend();
|
||||
}
|
||||
const index = this.#hashFunc(key);
|
||||
const bucket = this.#buckets[index];
|
||||
// 走訪桶，若遇到指定 key ，則更新對應 val 並返回
|
||||
for (const pair of bucket) {
|
||||
if (pair.key === key) {
|
||||
pair.val = val;
|
||||
return;
|
||||
}
|
||||
}
|
||||
// 若無該 key ，則將鍵值對新增至尾部
|
||||
const pair = new Pair(key, val);
|
||||
bucket.push(pair);
|
||||
this.#size++;
|
||||
}
|
||||
|
||||
/* 刪除操作 */
|
||||
remove(key) {
|
||||
const index = this.#hashFunc(key);
|
||||
let bucket = this.#buckets[index];
|
||||
// 走訪桶，從中刪除鍵值對
|
||||
for (let i = 0; i < bucket.length; i++) {
|
||||
if (bucket[i].key === key) {
|
||||
bucket.splice(i, 1);
|
||||
this.#size--;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* 擴容雜湊表 */
|
||||
#extend() {
|
||||
// 暫存原雜湊表
|
||||
const bucketsTmp = this.#buckets;
|
||||
// 初始化擴容後的新雜湊表
|
||||
this.#capacity *= this.#extendRatio;
|
||||
this.#buckets = new Array(this.#capacity).fill(null).map((x) => []);
|
||||
this.#size = 0;
|
||||
// 將鍵值對從原雜湊表搬運至新雜湊表
|
||||
for (const bucket of bucketsTmp) {
|
||||
for (const pair of bucket) {
|
||||
this.put(pair.key, pair.val);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* 列印雜湊表 */
|
||||
print() {
|
||||
for (const bucket of this.#buckets) {
|
||||
let res = [];
|
||||
for (const pair of bucket) {
|
||||
res.push(pair.key + ' -> ' + pair.val);
|
||||
}
|
||||
console.log(res);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
/* 初始化雜湊表 */
|
||||
const map = new HashMapChaining();
|
||||
|
||||
/* 新增操作 */
|
||||
// 在雜湊表中新增鍵值對 (key, value)
|
||||
map.put(12836, '小哈');
|
||||
map.put(15937, '小囉');
|
||||
map.put(16750, '小算');
|
||||
map.put(13276, '小法');
|
||||
map.put(10583, '小鴨');
|
||||
console.log('\n新增完成後，雜湊表為\nKey -> Value');
|
||||
map.print();
|
||||
|
||||
/* 查詢操作 */
|
||||
// 向雜湊表中輸入鍵 key ，得到值 value
|
||||
const name = map.get(13276);
|
||||
console.log('\n輸入學號 13276 ，查詢到姓名 ' + name);
|
||||
|
||||
/* 刪除操作 */
|
||||
// 在雜湊表中刪除鍵值對 (key, value)
|
||||
map.remove(12836);
|
||||
console.log('\n刪除 12836 後，雜湊表為\nKey -> Value');
|
||||
map.print();
|
||||
@@ -0,0 +1,177 @@
|
||||
/**
|
||||
* File: hashMapOpenAddressing.js
|
||||
* Created Time: 2023-06-13
|
||||
* Author: yuan0221 (yl1452491917@gmail.com), krahets (krahets@163.com)
|
||||
*/
|
||||
|
||||
/* 鍵值對 Number -> String */
|
||||
class Pair {
|
||||
constructor(key, val) {
|
||||
this.key = key;
|
||||
this.val = val;
|
||||
}
|
||||
}
|
||||
|
||||
/* 開放定址雜湊表 */
|
||||
class HashMapOpenAddressing {
|
||||
#size; // 鍵值對數量
|
||||
#capacity; // 雜湊表容量
|
||||
#loadThres; // 觸發擴容的負載因子閾值
|
||||
#extendRatio; // 擴容倍數
|
||||
#buckets; // 桶陣列
|
||||
#TOMBSTONE; // 刪除標記
|
||||
|
||||
/* 建構子 */
|
||||
constructor() {
|
||||
this.#size = 0; // 鍵值對數量
|
||||
this.#capacity = 4; // 雜湊表容量
|
||||
this.#loadThres = 2.0 / 3.0; // 觸發擴容的負載因子閾值
|
||||
this.#extendRatio = 2; // 擴容倍數
|
||||
this.#buckets = Array(this.#capacity).fill(null); // 桶陣列
|
||||
this.#TOMBSTONE = new Pair(-1, '-1'); // 刪除標記
|
||||
}
|
||||
|
||||
/* 雜湊函式 */
|
||||
#hashFunc(key) {
|
||||
return key % this.#capacity;
|
||||
}
|
||||
|
||||
/* 負載因子 */
|
||||
#loadFactor() {
|
||||
return this.#size / this.#capacity;
|
||||
}
|
||||
|
||||
/* 搜尋 key 對應的桶索引 */
|
||||
#findBucket(key) {
|
||||
let index = this.#hashFunc(key);
|
||||
let firstTombstone = -1;
|
||||
// 線性探查，當遇到空桶時跳出
|
||||
while (this.#buckets[index] !== null) {
|
||||
// 若遇到 key ，返回對應的桶索引
|
||||
if (this.#buckets[index].key === key) {
|
||||
// 若之前遇到了刪除標記，則將鍵值對移動至該索引處
|
||||
if (firstTombstone !== -1) {
|
||||
this.#buckets[firstTombstone] = this.#buckets[index];
|
||||
this.#buckets[index] = this.#TOMBSTONE;
|
||||
return firstTombstone; // 返回移動後的桶索引
|
||||
}
|
||||
return index; // 返回桶索引
|
||||
}
|
||||
// 記錄遇到的首個刪除標記
|
||||
if (
|
||||
firstTombstone === -1 &&
|
||||
this.#buckets[index] === this.#TOMBSTONE
|
||||
) {
|
||||
firstTombstone = index;
|
||||
}
|
||||
// 計算桶索引，越過尾部則返回頭部
|
||||
index = (index + 1) % this.#capacity;
|
||||
}
|
||||
// 若 key 不存在，則返回新增點的索引
|
||||
return firstTombstone === -1 ? index : firstTombstone;
|
||||
}
|
||||
|
||||
/* 查詢操作 */
|
||||
get(key) {
|
||||
// 搜尋 key 對應的桶索引
|
||||
const index = this.#findBucket(key);
|
||||
// 若找到鍵值對，則返回對應 val
|
||||
if (
|
||||
this.#buckets[index] !== null &&
|
||||
this.#buckets[index] !== this.#TOMBSTONE
|
||||
) {
|
||||
return this.#buckets[index].val;
|
||||
}
|
||||
// 若鍵值對不存在，則返回 null
|
||||
return null;
|
||||
}
|
||||
|
||||
/* 新增操作 */
|
||||
put(key, val) {
|
||||
// 當負載因子超過閾值時，執行擴容
|
||||
if (this.#loadFactor() > this.#loadThres) {
|
||||
this.#extend();
|
||||
}
|
||||
// 搜尋 key 對應的桶索引
|
||||
const index = this.#findBucket(key);
|
||||
// 若找到鍵值對，則覆蓋 val 並返回
|
||||
if (
|
||||
this.#buckets[index] !== null &&
|
||||
this.#buckets[index] !== this.#TOMBSTONE
|
||||
) {
|
||||
this.#buckets[index].val = val;
|
||||
return;
|
||||
}
|
||||
// 若鍵值對不存在，則新增該鍵值對
|
||||
this.#buckets[index] = new Pair(key, val);
|
||||
this.#size++;
|
||||
}
|
||||
|
||||
/* 刪除操作 */
|
||||
remove(key) {
|
||||
// 搜尋 key 對應的桶索引
|
||||
const index = this.#findBucket(key);
|
||||
// 若找到鍵值對，則用刪除標記覆蓋它
|
||||
if (
|
||||
this.#buckets[index] !== null &&
|
||||
this.#buckets[index] !== this.#TOMBSTONE
|
||||
) {
|
||||
this.#buckets[index] = this.#TOMBSTONE;
|
||||
this.#size--;
|
||||
}
|
||||
}
|
||||
|
||||
/* 擴容雜湊表 */
|
||||
#extend() {
|
||||
// 暫存原雜湊表
|
||||
const bucketsTmp = this.#buckets;
|
||||
// 初始化擴容後的新雜湊表
|
||||
this.#capacity *= this.#extendRatio;
|
||||
this.#buckets = Array(this.#capacity).fill(null);
|
||||
this.#size = 0;
|
||||
// 將鍵值對從原雜湊表搬運至新雜湊表
|
||||
for (const pair of bucketsTmp) {
|
||||
if (pair !== null && pair !== this.#TOMBSTONE) {
|
||||
this.put(pair.key, pair.val);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* 列印雜湊表 */
|
||||
print() {
|
||||
for (const pair of this.#buckets) {
|
||||
if (pair === null) {
|
||||
console.log('null');
|
||||
} else if (pair === this.#TOMBSTONE) {
|
||||
console.log('TOMBSTONE');
|
||||
} else {
|
||||
console.log(pair.key + ' -> ' + pair.val);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
// 初始化雜湊表
|
||||
const hashmap = new HashMapOpenAddressing();
|
||||
|
||||
// 新增操作
|
||||
// 在雜湊表中新增鍵值對 (key, val)
|
||||
hashmap.put(12836, '小哈');
|
||||
hashmap.put(15937, '小囉');
|
||||
hashmap.put(16750, '小算');
|
||||
hashmap.put(13276, '小法');
|
||||
hashmap.put(10583, '小鴨');
|
||||
console.log('\n新增完成後，雜湊表為\nKey -> Value');
|
||||
hashmap.print();
|
||||
|
||||
// 查詢操作
|
||||
// 向雜湊表中輸入鍵 key ，得到值 val
|
||||
const name = hashmap.get(13276);
|
||||
console.log('\n輸入學號 13276 ，查詢到姓名 ' + name);
|
||||
|
||||
// 刪除操作
|
||||
// 在雜湊表中刪除鍵值對 (key, val)
|
||||
hashmap.remove(16750);
|
||||
console.log('\n刪除 16750 後，雜湊表為\nKey -> Value');
|
||||
hashmap.print();
|
||||
60
zh-hant/codes/javascript/chapter_hashing/simple_hash.js
Normal file
60
zh-hant/codes/javascript/chapter_hashing/simple_hash.js
Normal file
@@ -0,0 +1,60 @@
|
||||
/**
|
||||
* File: simple_hash.js
|
||||
* Created Time: 2023-08-06
|
||||
* Author: yuan0221 (yl1452491917@gmail.com)
|
||||
*/
|
||||
|
||||
/* 加法雜湊 */
|
||||
function addHash(key) {
|
||||
let hash = 0;
|
||||
const MODULUS = 1000000007;
|
||||
for (const c of key) {
|
||||
hash = (hash + c.charCodeAt(0)) % MODULUS;
|
||||
}
|
||||
return hash;
|
||||
}
|
||||
|
||||
/* 乘法雜湊 */
|
||||
function mulHash(key) {
|
||||
let hash = 0;
|
||||
const MODULUS = 1000000007;
|
||||
for (const c of key) {
|
||||
hash = (31 * hash + c.charCodeAt(0)) % MODULUS;
|
||||
}
|
||||
return hash;
|
||||
}
|
||||
|
||||
/* 互斥或雜湊 */
|
||||
function xorHash(key) {
|
||||
let hash = 0;
|
||||
const MODULUS = 1000000007;
|
||||
for (const c of key) {
|
||||
hash ^= c.charCodeAt(0);
|
||||
}
|
||||
return hash & MODULUS;
|
||||
}
|
||||
|
||||
/* 旋轉雜湊 */
|
||||
function rotHash(key) {
|
||||
let hash = 0;
|
||||
const MODULUS = 1000000007;
|
||||
for (const c of key) {
|
||||
hash = ((hash << 4) ^ (hash >> 28) ^ c.charCodeAt(0)) % MODULUS;
|
||||
}
|
||||
return hash;
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
const key = 'Hello 演算法';
|
||||
|
||||
let hash = addHash(key);
|
||||
console.log('加法雜湊值為 ' + hash);
|
||||
|
||||
hash = mulHash(key);
|
||||
console.log('乘法雜湊值為 ' + hash);
|
||||
|
||||
hash = xorHash(key);
|
||||
console.log('互斥或雜湊值為 ' + hash);
|
||||
|
||||
hash = rotHash(key);
|
||||
console.log('旋轉雜湊值為 ' + hash);
|
||||
Reference in New Issue
Block a user