solution.json

{
  "type": "code_options",
  "author": "csdn.net",
  "source": "solution.md",
  "exercise_id": "6ce02858aefa4a0ea1909954c57ce3b2",
  "keywords": "图算法,算法高阶,最小生成树,最小生成树的形成",
  "title": "将字符串2小写字母复制到字符串1",
  "desc": [
    {
      "content": "\n<p>编写程序,输入字符串s2,将其中所有小写字母复制到字符串数组strl中。例如<br />\naal1bb22cc33de4AA55BB”,生成的strl为&#34;aabbccde&#34;。</p>",
      "language": "markdown"
    }
  ],
  "answer": [
    {
      "content": "",
      "language": "cpp"
    }
  ],
  "prepared": [
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ]
  ],
  "template": {
    "content": "#include<stdio.h>\nint main()\n{\n\tint sum=0,t=0,i;\n\tchar s[50],s1[50];\n\tscanf(\"%s\",s);\n\tfor(i=0;s[i]!='\\0';i++)\n\t{\n\t\tif(s[i]>='a'&&s[i]<='z'){\n\t\t\ts1[t++]=s[i];\n\t\t}\n\t}\n\ts1[t]='\\0';\n\tprintf(\"%s\",s1);\n}",
    "language": "cpp"
  },
  "node_id": "dailycode-e44f156234144b6fa859e5ed82d6bc4b",
  "license": "csdn.net",
  "created_at": 1637894160,
  "topic_link": "https://bbs.csdn.net/topics/600469859"
}