-
一、散列表
也叫 哈希表”或者“Hash 表”,利用的是**数组支持按照下标随机访问元素**,时间复杂度是 O(1) 的特性。
通过散列函数把元素的键值映射为下标,然后将数据存储在数组中对应下标的位置;当按照键值查询元素时,用同样的散列函数,将键值转化数组下标,从对应的数组下标的位置取数据。
散列表两个核心问题是**散列函数设计**和**散列冲突解决**。
散列冲突有两种常用的…
-
- [x] I am on the [latest](https://github.com/python-poetry/poetry/releases/latest) Poetry version.
- [x] I have searched the [issues](https://github.com/python-poetry/poetry/issues) of this re…
-
I'm using ECOS (Python) as a subroutine to solve Exponential Cone Programs. I have used it for two different projects and in both, I noticed that up 3% of the instances fail to be solved and the reas…
-
When tagging a rule with `[transition]`, it doesn't apply on supercooled expressions anymore. In the example below I'm playing with adding `[transition]` after `rule b 1 => c`
```
module TEST
synta…
-
Currently we have spanning_trees function to list all the spanning trees of undirected graph. But does not take the weight of edges into account. This ticket aims at implementing such algorithms to …
-
1.How to set M? Do I need to keep M?
2.The second question is, why can't I find the minimum using Newton's method? Is it because the problem is more complicated?
-
Howdy! I'm the developer of [Storyteller](https://gitlab.com/smoores/storyteller), which is a platform for automatically syncing ebooks and audiobooks. I'm interested in migrating to echogarden for th…
-
_From @petdance on July 27, 2012 13:30_
Andy gave the short answer. Here's longer form ...
I'm trying to search for two words in a line (order is not important).
I know I can just use two runs of Ac…
-
### 1. Arrays and Hashing (9)
- [x] [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) [B75]
- [x] [Valid Anagram](https://leetcode.com/problems/valid-anagram/) [B75]
- [x]…
-
这周主要是加强了动态规划相关内容,还有字符串相关的内容。字符串是面试比较多的出题类型,这里需要练习更多的。
最后更新一下做题情况,感谢老师的付出,后面要看自己的了。
| ToDo | In Progress | Finished
-- | -- | -- | --
Array | plus-one | | two-sumcontainer-with-most-watercl…