《九日集训》第十五轮 (第五讲) 排序

[舒服加]

学习内容：https://blog.csdn.net/WhereIsHeroFrom/article/details/120875926

 912. 排序数组

class Solution:
    def sortArray(self, nums: List[int]) -> List[int]:
        nums.sort()
        return nums

169. 多数元素

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        n = len(nums)//2
        max_num = max(nums)
        count = [0] * (max_num + 1)
        for num in nums:
            count[num] += 1
        if (count.index(max(count))) >= n:
            return(count.index(max(count)))

217. 存在重复元素

class Solution:
    def containsDuplicate(self, nums: List[int]) -> bool:
        nums.sort()
        flag = 0
        for i in range(len(nums)-1):
            if nums[i] == nums[i+1]:
                flag = 1
                break
        if flag == 1:
            return True
        else:
            return False

164. 最大间距

class Solution:
    def maximumGap(self, nums: List[int]) -> int:
        if len(nums)<2:
            return 0
        else:
            nums.sort()
            prev = float('inf')
            res = 0
            for i in nums:
                if res<(i-prev):
                    res = i-prev
                prev = i
            return res
        

905. 按奇偶排序数组

class Solution(object):
    def sortArrayByParity(self, A):
        return ([x for x in A if x % 2 == 0] +
                [x for x in A if x % 2 == 1])

976. Largest Perimeter Triangle

class Solution:
    def largestPerimeter(self, A: List[int]) -> int:
        A.sort(reverse=True)
        return next((x+y+z for x, y, z in zip(A, A[1:], A[2:]) if x<y+z), 0)

539. 最小时间差

def getMinutes(t: str) -> int:
    return ((ord(t[0]) - ord('0')) * 10 + ord(t[1]) - ord('0')) * 60 + (ord(t[3]) - ord('0')) * 10 + ord(t[4]) - ord('0')

class Solution:
    def findMinDifference(self, timePoints: List[str]) -> int:
        timePoints.sort()
        ans = float('inf')
        t0Minutes = getMinutes(timePoints[0])
        preMinutes = t0Minutes
        for i in range(1, len(timePoints)):
            minutes = getMinutes(timePoints[i])
            ans = min(ans, minutes - preMinutes)  # 相邻时间的时间差
            preMinutes = minutes
        ans = min(ans, t0Minutes + 1440 - preMinutes)  # 首尾时间的时间差
        return ans

881. Boats to Save People

class Solution:
    def numRescueBoats(self, people: List[int], limit: int) -> int:
        ans = 0
        people.sort()
        light, heavy = 0, len(people) - 1
        while light <= heavy:
            if people[light] + people[heavy] > limit:
                heavy -= 1
            else:
                light += 1
                heavy -= 1
            ans += 1
        return ans