2020-07-11

Author: JiayangWu

1507.转变日期格式/1507-转变日期格式.py

@@ -0,0 +1,13 @@
+class Solution(object):
+    def reformatDate(self, date):
+        """
+        :type date: str
+        :rtype: str
+        """
+        date = date.split(" ")
+        
+        day = "0" + date[0][:1] if len(date[0]) == 3 else date[0][:2]
+        mon = {"Jan":"01", "Feb":"02", "Mar":"03", "Apr":"04", "May":"05", "Jun":"06",
+               "Jul":"07", "Aug":"08", "Sep":"09", "Oct":"10", "Nov":"11", "Dec":"12"}[date[1]]
+        year = date[2]
+        return "-".join([year, mon, day])

1508.子数组和排序后的区间和/1508-子数组和排序后的区间和.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def rangeSum(self, nums, n, left, right):
+        """
+        :type nums: List[int]
+        :type n: int
+        :type left: int
+        :type right: int
+        :rtype: int
+        """
+        res = []
+        for i in range(n):
+            for j in range(i + 1, n + 1):
+                res.append(sum(nums[i:j]))
+        res.sort()
+        # print res
+        return sum(res[left - 1:right]) % (10 ** 9 + 7)
+                
+                

1509.三次操作后最大值与最小值的最小差/1509-三次操作后最大值与最小值的最小差.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def minDifference(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: int
+        """
+        if len(nums) <= 4:
+            return 0
+        nums.sort()
+
+        # 1. 去前三个
+        res = nums[-1] - nums[3]
+        # 2. 去前两个和最后一个
+        res = min(res, nums[-2] - nums[2])
+        # 3. 去第一个和最后两个
+        res = min(res, nums[-3] - nums[1])
+        # 4. 去最后三个
+        res = min(res, nums[-4] - nums[0])
+        return res

1510.石子游戏IV/1510-石子游戏IV.py

@@ -0,0 +1,15 @@
+class Solution(object):
+    def winnerSquareGame(self, n):
+        """
+        :type n: int
+        :rtype: bool
+        """
+        dp = [0 for _ in range(n + 1)]
+        dp[1] = 1
+        for i in range(2, n + 1):
+            for j in range(1, int(i ** 0.5 + 1)):
+                if not dp[i - j * j]:
+                    dp[i] = 1
+                    break
+        return dp[n] == 1
+                    

174.地下城游戏/174-地下城游戏.py

@@ -0,0 +1,20 @@
+class Solution(object):
+    def calculateMinimumHP(self, dungeon):
+        """
+        :type dungeon: List[List[int]]
+        :rtype: int
+        """
+        if len(dungeon[0])==0:
+            return 1
+        dungeon[-1][-1] = max(1,1-dungeon[-1][-1])
+        # 边界
+        for i in range(len(dungeon)-2,-1,-1):
+            dungeon[i][-1] = max(1,dungeon[i+1][-1]-dungeon[i][-1])
+        for j in range(len(dungeon[0])-2,-1,-1):
+            dungeon[-1][j] = max(1,dungeon[-1][j+1]-dungeon[-1][j])
+
+        for i in range(len(dungeon)-2,-1,-1):
+            for j in range(len(dungeon[0])-2,-1,-1):
+                dungeon[i][j] = max(1,min(dungeon[i][j+1]-dungeon[i][j],dungeon[i+1][j]-dungeon[i][j]))
+        # print(dungeon)
+        return dungeon[0][0]