本地CPU+6G内存部署类ChatGPT模型（Vicuna 小羊驼） - 知乎

conda create -n llm python=3.9
conda activate llm
conda install pytorch==1.13.1 cpuonly -c pytorch
pip install llama-cpp-python

from llama_cpp import Llama

# 路径替换成你自己的模型路径
llm = Llama(model_path="./models/ggml-vicuna-13b-1.1-q4_2.bin")


while True:
    # Name the planets in the solar system?
    prompt = input("prompt: ")
    # 相关控制参数自己调节
    output = llm(f"Q:{prompt} A:", max_tokens=128, stop=[roles[0]], echo=False)
    print("Answer: ", output["choices"][0]["text"])

Here is an example implementation of a Python function that finds the longest common subsequence of two input strings using dynamic programming:
```python
def lcs(s1, s2):
    n = len(s1)
    m = len(s2)

    # Initialize dp table with not available values
    dp = [[None] * (m+1) for _ in range(n+1)]

    # Fill dp table with starting value of 0
    for i in range(1, n+1):
        dp[i][0] = 0

    # Fill dp table with starting value of 0
    for j in range(1, m+1):
        dp[0][j] = 0

    # Iterate over all possible subsequences of s1 and s2
    for i in range(1, n+1):
        for j in range(1, m+1):
            if s1[i-1] == s2[j-1]:
                # If current characters match, increment dp[i][j] by 1
                dp[i][j] = max(dp[i][j], dp[i-1][j-1] + 1)
            else:
                # If current characters do not match, use the larger of the two options
                dp[i][j] = max(dp[i][j], max(dp[i-1][j], dp[i][j-1]))

    # Return the longest common subsequence
    return dp[n][m]
```
This function takes two input strings `s1` and `s2`, and returns the longest common subsequence of the two strings.

锅包肉是一道非常有名的广东菜，制作方法简单，口感鲜美。以下是一份锅包肉的做法：

所需材料：

* 猪里脊肉 500克
* 白蒜 3个
* 大葱 1根
* 洋葱 1根
* 红椒 1个
* 花椒 1个
* 生抽 适量
* 食用油 适量
* 盐、胡椒粉、蒜泥 适量

步骤：
1. 将猪里脊肉切成小块，用刀刻上竖直线，保持原有形状。
2. 將白蒜、大葱和洋葱切成顺序，再将红椒和花椒切成小段。
3. 在碗中加入生抽，用中火加热，放入肉片后盖上适量的食用油。
4. 当肉片发达香气时，将白蒜、大葱和洋葱一起加入碗中，用中火燒烂，直到肉片受烧后取出。