3011. 判断一个数组是否可以变为有序

修改矩阵

• 难度: medium
• 原始链接: https://leetcode.cn/problems/find-if-array-can-be-sorted
• 标签: 循环

解法一: 循环

go

func canSortArray(nums []int) bool {
  preBit := 0
  preNum := 0
  curNum := 0
  for _, num := range nums {
    if num < preNum {
      return false
    }
    curBit := calcBitNum(num)
    if curBit != preBit {
      if num < curNum {
        return false
      }
      preBit = curBit
      preNum = curNum
    }
    curNum = max(curNum, num)
  }
  return true
}

func calcBitNum(num int) int {
  count := 0
  for num != 0 {
    count++
    num &= num - 1
  }
  return count
}