> For the complete documentation index, see [llms.txt](https://fantasy-jxf.gitbook.io/artificial-intelligence/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://fantasy-jxf.gitbook.io/artificial-intelligence/interview/bi-shi-kuai-shou-180910.md).

# 快手

## 笔试-快手-180910

* 单选 20；编程 3

### Index

* [字符串归一化](https://fantasy-jxf.gitbook.io/artificial-intelligence/interview/pages/-L_GZbFe04froRgbNTy4#字符串归一化)
* [魔法深渊](https://fantasy-jxf.gitbook.io/artificial-intelligence/interview/pages/-L_GZbFe04froRgbNTy4#魔法深渊)
* [善变的同伴](https://fantasy-jxf.gitbook.io/artificial-intelligence/interview/pages/-L_GZbFe04froRgbNTy4#善变的同伴)

#### 字符串归一化

**Python**（AC）

```
from collections import Counter

s = input()
c = Counter(s)

res = ""
for key in sorted(c.keys()):
    res += key
    res += str(c[key])

print(res)
```

#### 魔法深渊

**Python**（AC）

```
def foo(n):
    dp = [0] * (n + 1)
    dp[0] = 1

    for i in range(1, n + 1):
        j = 1
        while j <= n:
            if i < j:
                break
            dp[i] = dp[i] + dp[i - j]
            j = j * 2
    return dp[n] % 1000000003


N = int(input())
for i in range(N):
    n = int(input())
    print(foo(n))
```

#### 善变的同伴

**思路**

```
作者：n不正
链接：https://www.nowcoder.com/discuss/106768
来源：牛客网

1、先把整个数组改成正负交错的数组，去掉首尾的负数(相邻的正数合并成一个正数，负数合并成一个负数) 
2、如果正数个数<=M，输出所有的正数之和
3、如果正数个数>M，将数组中[正负正]合并，该负数为数组中负数的最大值并且三者之和>三者最大值
4、直到3不满足或者正数个数<=M,输出最大的M个正数之和
```

**Python**（未测试）

* 按照上述思路实现的代码

  \`\`\`

  **N, M = list(map(int, input().split()))**

  **ns = list(map(int, input().split()))**

  N, M = 7, 3

  ns = \[1, 2, 3, -2, 3, -10, 3]

new\_ns = \[ns\[0]]

for i in ns\[1:]: if i == 0: continue if (new\_ns\[-1] > 0) == (i > 0): new\_ns\[-1] += i else: new\_ns.append(i)

## print(new\_ns)  # \[6, -2, 3, -10, 3]

## 去掉首尾的负数块

if len(new\_ns) >= 1 and new\_ns\[0] < 0: new\_ns.pop(0)

if len(new\_ns) >= 1 and new\_ns\[-1] < 0: new\_ns.pop(-1)

## print(new\_ns)  # \[6, -2, 3, -10, 3]

## 按奇偶划分奇数和偶数块

ns\_pos = new\_ns\[0::2] ns\_neg = new\_ns\[1::2] cnt\_pos = len(ns\_pos)

## print(cnt\_pos)  # 3

## print(ns\_pos)  # \[6, 3, 3]

## print(ns\_neg)  # \[-2, -10]

## 如果 M 的值小于正数块的数量则进行合并

updated = True while updated and M < cnt\_pos: """""" updated = False

```
mx_i = 0
# mx = max(ns_pos[mx_i] + ns_pos[mx_i+1] + ns_neg[mx_i], ns_pos[mx_i], ns_pos[mx_i])
mx = float("-inf")
for i in range(len(ns_neg)):
    tmp = ns_pos[i] + ns_pos[i+1] + ns_neg[i]
    if tmp < max(ns_pos[i], ns_pos[i+1]):  # 如果合并后减小则不合并
        continue
    if tmp > mx:
        updated = True
        mx = tmp
        mx_i = i

if updated:
    # 更新合并后的数组
    ns_neg.pop(mx_i)
    ns_pos[mx_i] = mx
    ns_pos.pop(mx_i+1)
    cnt_pos -= 1

# print(ns_pos)
# print(ns_neg)
```

ns\_pos.sort(reverse=True) print(sum(ns\_pos\[:M])) \`\`\`


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://fantasy-jxf.gitbook.io/artificial-intelligence/interview/bi-shi-kuai-shou-180910.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.