zoukankan      html  css  js  c++  java
  • [LeetCode] Repeated DNA Sequences

    This link has a great discussion about this problem. You may refer to it if you like. In fact, the idea and code in this passage is from the former link.

    Well, there is a very intuitive solution to this problem. That is, starting from the first letter of the string, extract a substring of length 10, check whether it has occurred and not been added to the result. If so, add it to the result; otherwise, visit the next letter and repeat the above process. However, a naive implementation of this idea will give the MLE error, and this is the real obstacle of the problem.

    Then we need to save spaces. Instead of keeping the whole substring, can be convert it to other formats? Well, you have noticed that there are only letters A, T, C, G in the substring. If we assign each letter 2 bits, then a 10-letter substring will only cost 20 bits and can thus be accommodated by a 32-bit integer, greatly lowering the space complexity.

    Then you may put this idea into code and get an simple Accepted solution as follows. Congratulations!

     1 class Solution {
     2 public:
     3     vector<string> findRepeatedDnaSequences(string s) {
     4         unordered_map<int, int> mp;
     5         vector<string> res;
     6         int i = 0, code = 0;
     7         while (i < 9)
     8             code = ((code << 2) | mapping(s[i++]));
     9         for (; i < (int)s.length(); i++) {
    10             code = (((code << 2) & 0xfffff) | mapping(s[i]));
    11             if (mp[code]++ == 1)
    12                 res.push_back(s.substr(i - 9, 10));
    13         }
    14         return res;
    15     }
    16 private:
    17     int mapping(char s) {
    18         if (s == 'A') return 0;
    19         if (s == 'C') return 1;
    20         if (s == 'G') return 2;
    21         if (s == 'T') return 3;
    22     }
    23 };

    Do you see the logic in the above code? Well, we first merge 9 letters into code. Then, each time we meet a new letter, we merge it to code by | mapping(s[i]) and mask the leftmost letter by & 0xfffff (20 bits take 5 hexadecimal digits). Thus we have a code for the current 10-letter substring. We check whether it has occurred exactly for once to decide whether to push it to the result or not.

    The above code can still be shorten using tricks from the above link. In fact, if we code A, T, C, G using 3 bits, the code will be as short as 10 lines! Refer to the above link to learn more!

  • 相关阅读:
    PHP中有多态么
    【Android】九宫格实现
    采用xshell链路本地虚拟机Linux
    读取资源文件的工具.
    dede织梦背景经常使用标签
    PHP第三个教训 PHP基本数据类型
    Linux经常使用的命令(必看)
    易Android登录Demo
    [2013山东ACM]省赛 The number of steps (可能DP,数学期望)
    web开发性能优化---UI接口章
  • 原文地址:https://www.cnblogs.com/jcliBlogger/p/4600085.html
Copyright © 2011-2022 走看看