ziyang_li/LeetCode
1
0
Fork 0
mirror of https://github.com/ShusenTang/LeetCode.git synced 2024-09-02 14:20:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix {{ bux

Browse Source
This commit is contained in:
唐树森 2019-09-04 16:30:48 +08:00 committed by GitHub
parent fa06e53cc7
commit 73a3737d05
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
solutions/187. Repeated DNA Sequences.md
View File

@ -43,7 +43,7 @@ public:
vector<string> findRepeatedDnaSequences(string s) { vector<string> findRepeatedDnaSequences(string s) {
unordered_set<int>substr_set; unordered_set<int>substr_set;
unordered_set<string>output_set; unordered_set<string>output_set;
unordered_map<int, int> mp{{'A', 0}, {'C', 1}, {'G', 2}, {'T', 3}}; // 注意学习这种初始化方法 unordered_map<int, int> mp{ {'A', 0}, {'C', 1}, {'G', 2}, {'T', 3} }; // 注意学习这种初始化方法
int cur = 0; // 当前子串对应的int值 int cur = 0; // 当前子串对应的int值
for (int i = 0; i < 9; ++i) cur = (cur << 2) | mp[s[i]]; for (int i = 0; i < 9; ++i) cur = (cur << 2) | mp[s[i]];