codility AbsDistinct

最新推荐文章于 2019-02-17 21:13:27 发布

原创最新推荐文章于 2019-02-17 21:13:27 发布 · 408 阅读

0 ·

CC 4.0 BY-SA版权

python 同时被 2 个专栏收录

62 篇文章

订阅专栏

codility

44 篇文章

订阅专栏

本文介绍了一个用于解决Codility Lesson15中AbsDistinct问题的Python算法。该算法通过双指针技巧，有效地找出给定数组中不同的绝对值数量。文章详细解释了算法的实现逻辑及步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question:codility Lesson15 AbsDistinct

My Answer:

def solution(A):
    absdistinct = 1
    head = 0
    tail = len(A) - 1
    cur = max(abs(A[0]),abs(A[-1])) # max abs num 

    while head <= tail:
        former = abs(A[head])
        if former == cur:
            head += 1
            continue

        latter = abs(A[tail])
        if latter == cur:
            tail -= 1
            continue

        if former >= latter:
            cur = former
            head += 1
        else:
            cur = latter
            tail -= 1

        absdistinct += 1

    return absdistinct