LeetCode贪心专题

1 盛最多水的容器

1.1 题目描述

给 n 个非负整数 a1，a2，…，an，每个数代表坐标中的一个点 (i, ai) 。在坐标内画 n 条垂直线，垂直线 i 的两个端点分别为 (i, ai) 和 (i, 0) 。找出其中的两条线，使得它们与 x 轴共同构成的容器可以容纳最多的水。

1.2 解法

1.2.1 枚举（计算量呈阶乘式增长）

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        self.height = height
        best_pro = 0
        for i in range(len(height)-1):
            for j in range(i,len(height)):
                if height[i]>=height[j]:
                    pro = height[j]*(j-i)
                else:
                    pro = height[i]*(j-i)
                if best_pro<pro:
                    best_pro = pro
        
        return best_pro

1.2.2 双指针（计算量较小）

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        self.height = height
        iright = len(height)-1
        ileft = 0
        pro_list = []
        while True:
            if height[iright]>=height[ileft]:
                pro = height[ileft]*(iright-ileft)
                pro_list.append(pro)
                ileft += 1
            else:
                pro = height[iright]*(iright-ileft)
                pro_list.append(pro)
                iright -= 1
            if ileft == iright:
                break
        return max(pro_list)

2 最大数

2.1 题目描述

给定一组非负整数 nums，重新排列每个数的顺序（每个数不可拆分）使之组成一个最大的整数。返回一个字符串。
如：输入[1,3,63]，输出：“6331”

2.2 解法

2.2.1 自定义排序

class Solution(object):
    def largestNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: str
        """
        self.nums = nums
        str_nums = [str(i) for i in nums]

        while True:
            str_nums_ori = str_nums.copy()
            for i in range(len(str_nums)-1):
                if str_nums[i]+str_nums[i+1] > str_nums[i+1]+str_nums[i]:
                    str_nums[i],str_nums[i+1] = str_nums[i+1],str_nums[i]
            if str_nums == str_nums_ori:
                break
        
        maxnum = ""
        for i in range(len(str_nums)-1,-1,-1):
            maxnum += str_nums[i]
        if maxnum[0] == "0":
            maxnum = "0"
        return maxnum

2.2.2 排序改进

class Solution(object):
    def largestNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: str
        """
        self.nums = nums
        str_nums = [str(i) for i in nums]
        str_nums.sort()
        while True:
            str_nums_ori = str_nums.copy()
            for i in range(len(str_nums)-1):
                if str_nums[i]+str_nums[i+1] > str_nums[i+1]+str_nums[i]:
                    str_nums[i],str_nums[i+1] = str_nums[i+1],str_nums[i]
            if str_nums == str_nums_ori:
                break
        maxnum = ""
        for i in range(len(str_nums)-1,-1,-1):
            maxnum += str_nums[i]
        if maxnum[0] == "0":
            maxnum = "0"
        return maxnum

3 待续

题目来源：LeetCode官网