{
  "system_prefix": null,
  "history_count": 1,
  "user_summary": {
    "text": "请详细回答以下问题：解释什么是递归，并举例说明。请展开论述，分点说明，条理清晰。",
    "has_image": false,
    "has_tool_result": false
  },
  "assistant_summary": {
    "text": "## 什么是递归\n\n递归（Recursion）是一种在计算机科学和数学中广泛使用的解决问题的方法。它的核心思想是：**一个函数直接或间接地调用自身**，通过将原问题拆解为更小、结构相似的",
    "tool_calls": [],
    "stop_reason": "length"
  }
}

Method: POST

URL: https://ark.cn-beijing.volces.com/api/v3/chat/completions

Headers:
{
  "authorization": "Bearer ark-f137c261-ce2c-4ac5-b065-fafb2270c3d7-1801e",
  "content-type": "application/json"
}

Body:
{
  "max_tokens": 50,
  "messages": [
    {
      "content": "请详细回答以下问题：解释什么是递归，并举例说明。请展开论述，分点说明，条理清晰。",
      "role": "user"
    }
  ],
  "model": "deepseek-v4-flash-ga-260731"
}

Headers:
{
  "content-length": "1127",
  "content-type": "application/json; charset=utf-8",
  "date": "Sun, 30 Aug 2026 13:27:31 GMT",
  "server": "istio-envoy",
  "vary": "Accept-Encoding",
  "x-client-request-id": "unknown-20260830212729-yulmTprw",
  "x-envoy-upstream-service-time": "2266",
  "x-request-id": "021788096448983fd0de7354b348b065f00b895e07126b8532e2e"
}

Body:
{
  "choices": [
    {
      "finish_reason": "length",
      "index": 0,
      "logprobs": null,
      "message": {
        "content": "## 什么是递归\n\n递归（Recursion）是一种在计算机科学和数学中广泛使用的解决问题的方法。它的核心思想是：**一个函数直接或间接地调用自身**，通过将原问题拆解为更小、结构相似的",
        "reasoning_content": "我们要求详细回答递归概念并举例说明。需要展开论述，分点说明，条理清晰。用户要求中文。我们需要提供递归的定义、要素、类型、示例（如阶乘、斐波那契、汉诺塔、目录遍历等），可能还要说明递归与迭代的区别，优缺点，递归的调用栈，基线条件与递归条件等。注意要详细，分点。确保回答全面。",
        "role": "assistant"
      }
    }
  ],
  "created": 1788096451,
  "id": "021788096448983fd0de7354b348b065f00b895e07126b8532e2e",
  "model": "deepseek-v4-flash-ga-260731",
  "service_tier": "default",
  "object": "chat.completion",
  "usage": {
    "completion_tokens": 138,
    "prompt_tokens": 109,
    "total_tokens": 247,
    "prompt_tokens_details": {
      "cached_tokens": 0
    },
    "completion_tokens_details": {
      "reasoning_tokens": 87
    }
  }
}

{
  "completion_tokens": 138,
  "completion_tokens_details": {
    "reasoning_tokens": 87
  },
  "prompt_tokens": 109,
  "prompt_tokens_details": {
    "cached_tokens": 0
  },
  "total_tokens": 247
}

Method: POST

URL: /v1/chat/completions

Headers:
{
  "accept-encoding": "gzip",
  "authorization": "Bearer sk_r4gAXloJQt74Cp4prb19OItKzoG77lLhjmWT4ei20Ua",
  "content-length": "338",
  "content-type": "application/json",
  "host": "api.tokendiet.cn",
  "via": "1.1 Caddy",
  "x-forwarded-for": "13.212.110.206",
  "x-forwarded-host": "api.tokendiet.cn",
  "x-forwarded-proto": "https"
}

Body:
{
  "model": "deepseek-v4-flash-g2",
  "messages": [
    {
      "role": "user",
      "content": "请详细回答以下问题：解释什么是递归，并举例说明。请展开论述，分点说明，条理清晰。"
    }
  ],
  "max_tokens": 50
}

Body:
{
  "choices": [
    {
      "finish_reason": "length",
      "index": 0,
      "logprobs": null,
      "message": {
        "content": "## 什么是递归\n\n递归（Recursion）是一种在计算机科学和数学中广泛使用的解决问题的方法。它的核心思想是：**一个函数直接或间接地调用自身**，通过将原问题拆解为更小、结构相似的",
        "reasoning_content": "我们要求详细回答递归概念并举例说明。需要展开论述，分点说明，条理清晰。用户要求中文。我们需要提供递归的定义、要素、类型、示例（如阶乘、斐波那契、汉诺塔、目录遍历等），可能还要说明递归与迭代的区别，优缺点，递归的调用栈，基线条件与递归条件等。注意要详细，分点。确保回答全面。",
        "role": "assistant"
      }
    }
  ],
  "created": 1788096451,
  "id": "021788096448983fd0de7354b348b065f00b895e07126b8532e2e",
  "model": "deepseek-v4-flash-g2",
  "object": "chat.completion",
  "service_tier": "default",
  "usage": {
    "completion_tokens": 138,
    "completion_tokens_details": {
      "reasoning_tokens": 87
    },
    "prompt_tokens": 109,
    "prompt_tokens_details": {
      "cached_tokens": 0
    },
    "total_tokens": 247
  }
}