First Upload at 3/8

Author: gyb1325

11. Container With Most Water.py

@@ -0,0 +1,14 @@
+class Solution:
+
+    def maxArea(self, height: List[int]) -> int:
+        l = 0
+        r = len(height) - 1
+        width = len(height) - 1
+        max_area = 0
+        for w in range(width, 0, -1):
+            max_area = max(max_area, w * min(height[l], height[r]))
+            if height[l] < height[r]:
+                l += 1
+            else:
+                r -= 1
+        return max_area

12. Integer to Roman.py

@@ -0,0 +1,70 @@
+class Solution:
+
+    def intToRoman(self, num):
+        """
+        :type num: int
+        :rtype: str
+        """
+        lst = []
+        while num > 0:
+            if num - 1000 >= 0:
+                lst.append("M")
+                num -= 1000
+                continue
+            if num - 900 >= 0:
+                lst.append("CM")
+                num -= 900
+                continue
+            if num - 500 >= 0:
+                lst.append("D")
+                num -= 500
+                continue
+            if num - 400 >= 0:
+                lst.append("CD")
+                num -= 400
+                continue
+            if num - 100 >= 0:
+                lst.append("C")
+                num -= 100
+                continue
+            if num - 90 >= 0:
+                lst.append("XC")
+                num -= 90
+                continue
+            if num - 50 >= 0:
+                lst.append("L")
+                num -= 50
+                continue
+            if num - 40 >= 0:
+                lst.append("XL")
+                num -= 40
+                continue
+            if num - 10 >= 0:
+                lst.append("X")
+                num -= 10
+                continue
+            if num - 9 >= 0:
+                lst.append("IX")
+                num -= 9
+                continue
+            if num - 5 >= 0:
+                lst.append("V")
+                num -= 5
+                continue
+            if num - 4 >= 0:
+                lst.append("IV")
+                num -= 4
+                continue
+            if num - 3 >= 0:
+                lst.append("III")
+                num -= 3
+                continue
+            if num - 2 >= 0:
+                lst.append("II")
+                num -= 2
+                continue
+            if num - 1 >= 0:
+                lst.append("I")
+                num -= 1
+                continue
+        return "".join(lst)

51. N-Queens.py

@@ -0,0 +1,22 @@
+class Solution:
+
+    def solveNQueens(self, n: int) -> List[List[str]]:
+        res = []
+        self.dfs([-1] * n, 0, [], res)
+        return res
+
+    def dfs(self, nums, index, path, res):
+        if index == len(nums):
+            res.append(path)
+            return
+        for i in range(len(nums)):
+            nums[index] = i
+            if self.isValid(nums, index):
+                temp = "." * len(nums)
+                self.dfs(nums, index + 1, path + [temp[:i] + "Q" + temp[i + 1:]], res)
+
+    def isValid(self, nums, index):
+        for i in range(index):
+            if abs(nums[i] - nums[index]) == index - i or nums[i] == nums[index]:
+                return False
+        return True

52. N-Queens II.py

@@ -0,0 +1,22 @@
+class Solution:
+
+    def totalNQueens(self, n: int) -> int:
+        res = [0]
+        self.dfs([-1] * n, 0, [], res)
+        return res[0]
+
+    def dfs(self, nums, index, path, res):
+        if index == len(nums):
+            res[0] += 1
+            return
+        for i in range(len(nums)):
+            nums[index] = i
+            if self.isValid(nums, index):
+                temp = "." * len(nums)
+                self.dfs(nums, index + 1, path + [temp[:i] + "Q" + temp[i + 1:]], res)
+
+    def isValid(self, nums, index):
+        for i in range(index):
+            if abs(nums[i] - nums[index]) == index - i or nums[i] == nums[index]:
+                return False
+        return True

9. Palindrome Number.py

@@ -0,0 +1,7 @@
+class Solution:
+
+    def isPalindrome(self, x: int) -> bool:
+        if x < 0:
+            return False
+        s = str(x)
+        return s == s[::-1]