leetcode
  • Preface
  • Array
    • 1. Two Sum
    • 11. Container With Most Water
    • 53. Maximum Subarray (value)
    • 83. Remove Duplicates from Sorted Array
    • 169. Majority Element
    • 121. Best Time to Buy and Sell Stock I
    • 122. Best Time to Buy and Sell Stock II
    • 167. Two Sum II - Input array is sorted
    • 217. Contain Duplicates
    • 219. Contains Duplicate II
    • 268. Missing Number
    • 283. Move Zeroes
    • 414. Third Maximum Number
    • 509. Fibonacci Number
    • 832. Flipping an Image
    • 905. Sort Array By Parity
    • 922. Sort Array By Parity II
    • 977. Squares of a Sorted Array
    • 1051. Height Checker
    • 1122. Relative Sort Array
  • String
    • 8. String to Integer (atoi)
    • 3. Longest Substring Without Repeating Characters
    • 5. Longest Palindromic Substring
    • 6. ZigZag Conversion
    • 12. Integer to Roman
    • 13. Roman to Integer
    • 14. Longest Common Prefix
    • 20. Valid Parentheses
    • 28. Implement strStr()
    • 58. Length of Last Word
    • 67. Add Binary
    • 125. Valid Palindrome
    • 344. Reverse String
    • 387. First Unique Character in a String
    • 709. To Lower Case
    • 804. Unique Morse Code Words
    • 929. Unique Email Addresses
    • 1108. Defanging an IP Address
  • Linked List
    • 2. Add Two Numbers
  • Tree
  • Math
    • 7. Reverse Integer
    • 9. Palindrome Number
    • 69. Sqrt(x)
    • 204. Count Primes
  • Data Structure
    • Sorting
    • Hash Table, Map, Object, Set (JS)
    • String (JS)
    • Linear Data Structure (JS)
    • Trees, Heaps, Graphs
    • HashSet & HashMap & HashTable in Java
  • Contest
    • Easy
      • Decrease Elements To Make Array Zigzag
      • Number of Equivalent Domino Pairs
    • Medium
      • Longest Chunked Palindrome Decomposition
      • Snapshot Array
      • Binary Tree Coloring Game
      • Maximum of Absolute Value Expression
      • Minimum Cost Tree From Leaf Values
      • Shortest Path with Alternating Colors
    • Hard
Powered by GitBook
On this page
  • Question
  • Code

Was this helpful?

  1. Array

1051. Height Checker

🟩 Easy

Question

Students are asked to stand in non-decreasing order of heights for an annual photo.

Return the minimum number of students not standing in the right positions. (This is the number of students that must move in order for all students to be standing in non-decreasing order of height.)

Example 1:

Input: [1,1,4,2,1,3]
Output: 3
Explanation: 
Students with heights 4, 1 and 3 are not standing in the right positions.

Note:

  1. 1 <= heights.length <= 100

  2. 1 <= heights[i] <= 100

Code 

def heightChecker(self, heights: List[int]) -> int:
    s = sorted(heights)
    count = 0
    for i in range(len(heights)):
        if s[i] != heights[i]:
            count += 1
    return count
Previous977. Squares of a Sorted ArrayNext1122. Relative Sort Array

Last updated 5 years ago

Was this helpful?