Hello 算法 1.2.0 kotlin版ableList<MutableList<Pair>> // 桶数组 /* 构造方法 */ init { size = 0 capacity = 4 loadThres = 2.0 / 3.0 extendRatio = 2 buckets = mutableListOf() for (i in 0..<capacity) { buckets.add(mutableListOf(…0 魔豆 | 382 页 | 18.48 MB | 10 月前3- Hello 算法 1.2.0 C++版>> buckets; // 桶陣列 public: /* 建構子 */ HashMapChaining() : size(0), capacity(4), loadThres(2.0 / 3.0), extendRatio(2) { buckets.resize(capacity); } /* 析構方法 */ ~HashMapChaining() { for (auto &buc…0 魔豆 | 379 页 | 18.79 MB | 10 月前3
- Hello 算法 1.2.0 swift版容倍數 var buckets: [[Pair]] // 桶陣列 /* 建構子 */ init() { size = 0 capacity = 4 loadThres = 2.0 / 3.0 extendRatio = 2 buckets = Array(repeating: [], count: capacity) } /* 雜湊函式 */ func hashFunc(ke…0 魔豆 | 379 页 | 18.79 MB | 10 月前3
- Hello 算法 1.2.0 ruby版ning ### 构造方法 ### def initialize @size = 0 # 键值对数量 @capacity = 4 # 哈希表容量 @load_thres = 2.0 / 3.0 # 触发扩容的负载因子阈值 @extend_ratio = 2 # 扩容倍数第 6 章 哈希表 www.hello‑algo.com 119 @buckets = Array.new(@cap…0 魔豆 | 372 页 | 18.44 MB | 10 月前3
- Hello 算法 1.2.0 swift版倍数 var buckets: [[Pair]] // 桶数组 /* 构造方法 */ init() { size = 0 capacity = 4 loadThres = 2.0 / 3.0 extendRatio = 2 buckets = Array(repeating: [], count: capacity) } /* 哈希函数 */ func hashFunc(ke…0 魔豆 | 379 页 | 18.48 MB | 10 月前3
- Hello 算法 1.2.0 java版ckets; // 桶陣列 /* 建構子 */ public HashMapChaining() { size = 0; capacity = 4; loadThres = 2.0 / 3.0; extendRatio = 2; buckets = new ArrayList<>(capacity); for (int i = 0; i < capacity; i++) { bu…0 魔豆 | 379 页 | 18.79 MB | 10 月前3
- Hello 算法 1.2.0 javascript版/ 桶数组 /* 构造方法 */ 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) => []); } …0 魔豆 | 379 页 | 18.47 MB | 10 月前3
- Hello 算法 1.2.0 python版__(self): """ 构造方法""" self.size = 0 # 键值对数量 self.capacity = 4 # 哈希表容量 self.load_thres = 2.0 / 3.0 # 触发扩容的负载因子阈值 self.extend_ratio = 2 # 扩容倍数 self.buckets = [[] for _ in range(self.capacity)] # 桶…0 魔豆 | 364 页 | 18.43 MB | 10 月前3
- Hello 算法 1.2.0 dart版r>> buckets; // 桶数组 /* 构造方法 */ HashMapChaining() { size = 0; capacity = 4; loadThres = 2.0 / 3.0; extendRatio = 2; buckets = List.generate(capacity, (_) => []); } /* 哈希函数 */ int hashFunc(int…0 魔豆 | 378 页 | 18.46 MB | 10 月前3
- Hello 算法 1.2.0 typescript版/ 桶数组 /* 构造方法 */ 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) => []); } …0 魔豆 | 383 页 | 18.49 MB | 10 月前3
共 12 条
- 1
- 2