1. Description

Height Checker

2. Solution

Version 1

class Solution:
    def heightChecker(self, heights):
       count = 0
       result = sorted(heights)
       for i in range(len(heights)):
           if heights[i] != result[i]:
               count += 1
       return count

Reference

https://leetcode.com/problems/height-checker/

Leetcode 1051. Height Checker
文章作者：Tyan博客：noahsnail.com[http://noahsnail.com] | CSDN[ht...
LeetCode 1051. Height Checker (E
Students are asked to stand in non-decreasing order of he...
1051. Height Checker
1. 题目链接： https://leetcode.com/problems/height-checker/ S...
1051. Height Checker
解法一进行排序，然后比较相同的index不同的值的个数。解法二计数排序注意指的范围 1-100 （但是数组...
LeetCode：1051. 高度检查器
问题链接 1051. 高度检查器[https://leetcode.cn/problems/height-chec...
366. Find Leaves of Binary Tree
LeetCode Link depth and height are properties of a node:T...
2019-02-17
LeetCode 310. Minimum Height Trees Description For an und...
Minimum Height Trees
题目 https://leetcode.com/problems/minimum-height-trees/#/d...
LeetCode 1051. 高度检查器
题目学校在拍年度纪念照时，一般要求学生按照非递减的高度顺序排列。请你返回能让所有学生以非递减高度排列的...
Leetcode 1051. 高度检查器
题目描述学校在拍年度纪念照时，一般要求学生按照非递减的高度顺序排列。请你返回至少有多少个学生没有站在正确位...