3. Longest Substring Without Repeating Characters

3.1 改善代碼

class Solution(object):
    def lengthOfLongestSubstring(self, s):
        """
        :type s: str
        :rtype: int
        """
        subdict ={}
        start = end = 0
        maxlen = 0
        while end < len(s):
            if s[end] in subdict:
                newStart = subdict[s[end]]
                for i in range(start, newStart):
                    subdict.pop(s[i])
                start = newStart + 1
                #重復值在substr的value要變成當前的end位置
                subdict[s[newStart]] = end

            else:
                subdict[s[end]]=end
                if end - start + 1 > maxlen:
                    maxlen = end - start +1
            end += 1
        return maxlen

13. Roman to Integer

13.1 初始代碼

class Solution:
    def romanToInt(self, s: str) -> int:
        values = {'I':1, 'V':5, 'X':10, 'L':50, 'C':100, 'D':500, 'M':1000}
        res = 0
        pos = 0
        while pos <= len(s)-1:
            if pos + 1 <= len(s) - 1 and s[pos:pos+2] in ('IV', 'IX', 'XL', 'XC', 'CD', 'CM'):
                  res = res - values[s[pos]] + values[s[pos+1]]
                  pos += 2
            else:
                  res = res + values[s[pos]]
                  pos += 1
        return res