452. Minimum Number of Arrows to Burst Balloons

题目要求：

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter and hence the x-coordinates of start and end of the diameter suffice. Start is always smaller than end. There will be at most 104 balloons.

An arrow can be shot up exactly vertically from different points along the x-axis. A balloon with xstart and xend bursts by an arrow shot at x if xstart ≤ x ≤ xend. There is no limit to the number of arrows that can be shot. An arrow once shot keeps travelling up infinitely. The problem is to find the minimum number of arrows that must be shot to burst all balloons.

Examples:

Input:
[[10,16], [2,8], [1,6], [7,12]]

Output:
2

Explanation:
One way is to shoot one arrow for example at x = 6 (bursting the balloons [2,8] and [1,6]) and another arrow at x = 11 (bursting the other two balloons).

解题思路：

• 让后所有的元素根据第二值进行排序

代码：

class Solution(object):
    def findMinArrowShots(self, points):
        """
        :type points: List[List[int]]
        :rtype: int
        """
        if not points:
            return False

        points = sorted(points, key=lambda x: x[1])

        curmax, num = points[0][1], 1
        for balloon in points:
            if balloon[0] > curmax:
                curmax = balloon[1]
                num += 1
        return num

if __name__ == "__main__":
    print(Solution.findMinArrowShots(self=None, points = [[9,12],[1,10],[4,11],[8,12],[3,9],[6,9],[6,7]]))

python：sort()函数和lambda表达式

• lambda表达式：

• 对列表List进行排序的话，python提供了两种排序方法：sort()与sorted()的不同在于，sort是在原位重新排列列表，而sorted()是产生一个新的列表。
  1.用List的成员函数sort.()进行排序
  L.sort(cmp=None, key=None, reverse=False) -- stable sort IN PLACE（原地进行排序）;
  cmp(x, y) -> -1, 0, 1

• 

  .sort()

  2.用built-in内建函数sorted进行排序
  sorted(iterable, cmp=None, key=None, reverse=False) --> new sorted list（返回一个新的列表）

• 

  sorted(a)

iterable：是可迭代类型;
cmp：用于比较的函数，比较什么由key决定,有默认值，迭代集合中的一项;
key：用列表元素的某个属性和函数进行作为关键字，有默认值，迭代集合中的一项;
reverse：排序规则. reverse = True 或者 reverse = False，有默认值。
返回值：是一个经过排序的可迭代类型，与iterable一样。
key和cmp可以实现相同的功能，key的效率高于cmp。

• 

  遍历二维数组里面的元素
• 对a按照第二个关键字进行排序：
• 

  根据第二个关键字进行排序
• 对a先根据第二个关键字进行排序，然后根据第一个关键字进行排序
• 

  先根据第二个关键字然后根据第一个关键字进行排序

• 

  遍历二维数组的元素
• 

  遍历二维数组每个元素的第二个元素