Doubao Seed Code：字节跳动 AI 代码生成模型 - 完整 API 指南

from openai import OpenAI

client = OpenAI(
    api_key="your-crazyrouter-api-key",
    base_url="https://crazyrouter.com/v1"
)

response = client.chat.completions.create(
    model="doubao-seed-code-preview-251028",
    messages=[
        {
            "role": "user",
            "content": "Write a Python function to check if a number is prime. Include type hints and docstring."
        }
    ],
    max_tokens=1000,
    temperature=0.7
)

print(response.choices[0].message.content)

import OpenAI from 'openai';

const client = new OpenAI({
    apiKey: 'your-crazyrouter-api-key',
    baseURL: 'https://crazyrouter.com/v1'
});

async function generateCode() {
    const response = await client.chat.completions.create({
        model: 'doubao-seed-code-preview-251028',
        messages: [
            {
                role: 'user',
                content: 'Write a TypeScript function to validate email addresses using regex.'
            }
        ],
        max_tokens: 1000
    });

    console.log(response.choices[0].message.content);
}

generateCode();

curl -X POST https://crazyrouter.com/v1/chat/completions \
  -H "Authorization: Bearer your-crazyrouter-api-key" \
  -H "Content-Type: application/json" \
  -d '{
    "model": "doubao-seed-code-preview-251028",
    "messages": [
      {
        "role": "user",
        "content": "Write a Python function to sort a list using quicksort algorithm."
      }
    ],
    "max_tokens": 1000
  }'

def is_prime(n: int) -> bool:
    """
    Check if an integer is a prime number.

    A prime number is a natural number greater than 1 that has no
    positive divisors other than 1 and itself.

    Args:
        n (int): The integer to check.

    Returns:
        bool: True if n is prime, False otherwise.

    Examples:
        >>> is_prime(2)
        True
        >>> is_prime(4)
        False
        >>> is_prime(17)
        True
    """
    if n <= 1:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False

    max_divisor = int(n ** 0.5) + 1
    for d in range(3, max_divisor, 2):
        if n % d == 0:
            return False
    return True

# Good prompt
"""
Write a Python function that:
1. Takes a list of integers as input
2. Returns the top K largest elements
3. Uses a heap for O(n log k) complexity
4. Includes type hints and docstring
"""

# Less effective prompt
"Write a function to find largest elements"

# Include relevant context
messages = [
    {
        "role": "system",
        "content": "You are a Python expert. Follow PEP 8 style guide and include comprehensive error handling."
    },
    {
        "role": "user",
        "content": "Write a function to parse JSON from a file safely."
    }
]