Leetcode日练笔记13 #485 #1295 #977 Max Consecutive 1s & Find Nums with Even Number of Digits & Squares

最新推荐文章于 2025-11-25 12:02:55 发布

原创最新推荐文章于 2025-11-25 12:02:55 发布 · 537 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python #算法

leetcode日练专栏收录该内容

39 篇文章

订阅专栏

这篇博客涵盖了三个不同的算法问题：1) 在二进制数组中找到最长连续1的子串；2) 计算包含偶数位数的整数的数量；3) 对排序数组进行平方并保持排序。解决方案分别涉及迭代计数、元素位数检查和平方后排序。这些算法展示了基础数据处理和数组操作的有效方法。

#485 Max Consecutive Ones

Given a binary array nums, return the maximum number of consecutive 1's in the array.

解题思路：

判断是不是1，是的话counter开始计数。遇到零的话，把counter的数字与之前的比较后取大的数。然后重新计数。

class Solution:
    def findMaxConsecutiveOnes(self, nums: List[int]) -> int:
        count, i, tem = 0, 0, 0
        while i < len(nums):
            if nums[i] == 1:
                count += 1
            else:
                tem = max(count, tem)
                count = 0
            i += 1
        return max(tem, count)

runtime:

#1295 Find Numbers with Even Number of Digits

Given an array nums of integers, return how many of them contain an even number of digits.

解题思路：

算每个element的len，偶数的计数。

class Solution:
    def findNumbers(self, nums: List[int]) -> int:
        counter = 0
        for i in nums:
            if not len(str(i))%2:
                counter += 1
        return counter

runtime:

#977 Squares of a Sorted Array

Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.

解题思路：

就挨个求平方，然后sorted()。

class Solution:
    def sortedSquares(self, nums: List[int]) -> List[int]:
        new = []
        for i in nums:
            new.append(i*i)
        return sorted(new)

runtime: