2019-5-24

Author: JiayangWu

0159.至多包含两个不同字符的最长子串/0159-至多包含两个不同字符的最长子串.py

@@ -0,0 +1,32 @@
+class Solution(object):
+    def lengthOfLongestSubstringTwoDistinct(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+        left, right = 0, 0
+        queue = []
+        last_pos = {}
+        res = 0
+        for right in range(len(s)):
+            if s[right] in queue:
+                last_pos[s[right]] = right
+            elif s[right] not in queue:
+                if len(queue) >= 2:
+
+                    if last_pos[queue[0]] < last_pos[queue[1]]: #°Ñ0ºÅÔªËØÌßµô
+                        left = last_pos[queue[0]] + 1
+                        last_pos.pop(queue[0])
+                        queue.pop(0)
+                    else:
+                        left = last_pos[queue[1]] + 1
+                        last_pos.pop(queue[1])
+                        queue.pop(1)
+                        
+                queue.append(s[right])
+                last_pos[s[right]] = right
+            # print s[left:right + 1]
+            res = max(res, right - left + 1)
+        return res
+                        
+        return res 

0281.锯齿迭代器/0281-锯齿迭代器.py

@@ -0,0 +1,41 @@
+class ZigzagIterator(object):
+
+    def __init__(self, v1, v2):
+        """
+        Initialize your data structure here.
+        :type v1: List[int]
+        :type v2: List[int]
+        """
+        self.list = []
+        if v1 and v2:
+            i = 0
+            for i in range(min(len(v1), len(v2))):
+                self.list.append(v1[i])
+                self.list.append(v2[i])
+            if v1[i + 1:]:
+                self.list += v1[i + 1:]
+            else:
+                self.list += v2[i + 1:]
+            
+        elif v1:
+            self.list = v1
+        else:
+            self.list = v2
+        self.index = 0
+    def next(self):
+        """
+        :rtype: int
+        """
+        self.index += 1
+        return self.list[self.index - 1]
+
+    def hasNext(self):
+        """
+        :rtype: bool
+        """
+        return self.index != len(self.list)
+        
+
+# Your ZigzagIterator object will be instantiated and called as such:
+# i, v = ZigzagIterator(v1, v2), []
+# while i.hasNext(): v.append(i.next())

0348.判定井字棋胜负/0348-判定井字棋胜负.py

@@ -0,0 +1,70 @@
+class TicTacToe(object):
+
+    def __init__(self, n):
+        """
+        Initialize your data structure here.
+        :type n: int
+        """
+        self.size = n
+        self.board = [[0 for _ in range(n)] for j in range(n) ]
+    def move(self, row, col, player):
+        """
+        Player {player} makes a move at ({row}, {col}).
+        @param row The row of the board.
+        @param col The column of the board.
+        @param player The player, can be either 1 or 2.
+        @return The current winning condition, can be either:
+                0: No one wins.
+                1: Player 1 wins.
+                2: Player 2 wins.
+        :type row: int
+        :type col: int
+        :type player: int
+        :rtype: int
+        """
+        self.board[row][col] = player
+        if self.check(row, col, player):
+            return player
+
+        return 0
+        
+        
+    def check(self, row, col, toe):
+        row_valid = True
+        col_valid = True
+        
+        
+        for i in range(self.size):
+            if self.board[row][i] != toe:
+                row_valid = False
+            if self.board[i][col] != toe:
+                # print i, self.board[col][i], toe, col_valid
+                col_valid = False
+        
+        if row != col and row + col != self.size - 1:
+            return row_valid or col_valid
+        
+        dia_valid1 = False
+        dia_valid2 = False
+        if row == col:
+            dia_valid1 = True
+            for i in range(self.size):
+                if self.board[i][i] != toe:
+                    dia_valid1 = False
+        if row + col == self.size - 1:
+            dia_valid2 = True
+            for i in range(self.size):
+                if self.board[i][self.size - 1 - i] != toe:
+                    dia_valid2 = False
+        # print self.board
+        # print (row, col), toe, row_valid, col_valid ,dia_valid1 ,dia_valid2
+        return row_valid or col_valid or dia_valid1 or dia_valid2
+        
+        
+        # for j in range(self.)
+        
+
+
+# Your TicTacToe object will be instantiated and called as such:
+# obj = TicTacToe(n)
+# param_1 = obj.move(row,col,player)

0702.搜索长度未知的有序数组/0702-搜索长度未知的有序数组.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def search(self, reader, target):
+        """
+        :type reader: ArrayReader
+        :type target: int
+        :rtype: int
+        """
+        i = 0
+        tmp = reader.get(i)
+        if tmp > target: #target比第一个元素都小，所以不存在
+            return -1
+        while tmp != 2147483647:
+            if tmp == target: #找到了
+                return i
+            if tmp > target: #后面的元素都比target大，找不到
+                break
+            i += 1
+            tmp = reader.get(i)
+        return -1 

0933.最近的请求次数/0933-最近的请求次数.py

@@ -0,0 +1,16 @@
+from collections import deque
+class RecentCounter(object):
+    def __init__(self):
+        self.queue = deque()
+
+    def ping(self, t):
+        """
+        :type t: int
+        :rtype: int
+        """
+        self.queue.append(t)
+        
+        while(self.queue[0] < t - 3000):
+            self.queue.popleft()
+
+        return len(self.queue)