请详细回答以下问题：解释什么是递归，并举例说明。请展开论述，分点说明，条理清晰。

Method: POST

URL: https://tokease.cn/v1/chat/completions

Headers:
{
  "Authorization": "Bearer sk-oRd5RE9JhT1bDLQ3lOZgdkESeCuowucrcNX16gZEgHecnxmu",
  "Content-Type": "application/json"
}

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

Headers:
{
  "Content-Length": "942",
  "Content-Type": "application/json",
  "Date": "Fri, 21 Aug 2026 08:20:31 GMT",
  "Req-Arrive-Time": "1787300430923",
  "Req-Cost-Time": "451",
  "Resp-Start-Time": "1787300431375",
  "Server": "nginx",
  "Set-Cookie": "route=b6817f60ab83a9ecf16ead57be0f0f66; Path=/",
  "Vary": "Accept-Encoding",
  "Via": "1.1 Caddy",
  "X-Envoy-Upstream-Service-Time": "444",
  "X-New-Api-Version": "v0.0.0",
  "X-Oneapi-Request-Id": "202608210820308927635648268d9d6b4sCQnM5",
  "X-Request-Id": "aec183eb-8b7a-47e1-b418-f6a22f2cb284"
}

Body:
{
  "id": "chatcmpl-bcc8761e-92ea-4840-b4df-d43074fd8e61",
  "object": "chat.completion",
  "created": 1787300413,
  "model": "deepseek-v4-flash",
  "choices": [
    {
      "index": 0,
      "message": {
        "role": "assistant",
        "content": "### 递归的详细解释\n\n递归（Recursion）是计算机科学和数学中一种强大的问题求解方法，其核心思想是**函数直接或间接地调用自身**，通过将一个大问题分解为若干个结构相同、规模更",
        "refusal": null,
        "annotations": null,
        "audio": null,
        "function_call": null,
        "reasoning": null
      },
      "logprobs": null,
      "finish_reason": "length",
      "stop_reason": null,
      "token_ids": null,
      "routed_experts": null
    }
  ],
  "service_tier": null,
  "system_fingerprint": "vllm-0.25.1-dp8-ep-1ccbc6be",
  "usage": {
    "prompt_tokens": 30,
    "total_tokens": 80,
    "completion_tokens": 50,
    "prompt_tokens_details": {
      "cached_tokens": 0,
      "multimodal_tokens": null
    }
  },
  "prompt_logprobs": null,
  "prompt_token_ids": null,
  "prompt_text": null,
  "kv_transfer_params": null,
  "metrics": null
}

{
  "prompt_tokens": 30,
  "total_tokens": 80,
  "completion_tokens": 50,
  "prompt_tokens_details": {
    "cached_tokens": 0,
    "multimodal_tokens": null
  }
}

Method: POST

URL: /v1/chat/completions

Headers:
{
  "Accept": "*/*",
  "Accept-Encoding": "gzip",
  "Authorization": "Bearer sk_r4gAXloJQt74Cp4prb19OItKzoG77lLhjmWT4ei20Ua",
  "Content-Length": "210",
  "Content-Type": "application/json",
  "User-Agent": "Go-http-client/2.0",
  "Via": "2.0 Caddy",
  "X-Forwarded-For": "13.212.110.206",
  "X-Forwarded-Host": "api.tokendiet.cn",
  "X-Forwarded-Proto": "https"
}

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

Body:
{
  "choices": [
    {
      "finish_reason": "length",
      "index": 0,
      "logprobs": null,
      "message": {
        "annotations": null,
        "audio": null,
        "content": "### 递归的详细解释\n\n递归（Recursion）是计算机科学和数学中一种强大的问题求解方法，其核心思想是**函数直接或间接地调用自身**，通过将一个大问题分解为若干个结构相同、规模更",
        "function_call": null,
        "reasoning": null,
        "refusal": null,
        "role": "assistant"
      },
      "routed_experts": null,
      "stop_reason": null,
      "token_ids": null
    }
  ],
  "created": 1787300413,
  "id": "chatcmpl-gsTqZtQ3LeioAWAB",
  "kv_transfer_params": null,
  "metrics": null,
  "model": "deepseek-v4-flash-g1",
  "object": "chat.completion",
  "prompt_logprobs": null,
  "prompt_text": null,
  "prompt_token_ids": null,
  "service_tier": null,
  "system_fingerprint": "vllm-0.25.1-dp8-ep-1ccbc6be",
  "usage": {
    "completion_tokens": 50,
    "prompt_tokens": 30,
    "prompt_tokens_details": {
      "cached_tokens": 0,
      "multimodal_tokens": null
    },
    "total_tokens": 80
  }
}