将内容逆序输出(Output the contents in reverse order).docVIP

将内容逆序输出(Output the contents in reverse order).doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
将内容逆序输出(Output the contents in reverse order)

将内容逆序输出(Output the contents in reverse order) Ten point one Enter a string (less than 80 characters) at the end of the carriage return, output its contents in reverse order. For example, ABCD, the output is DCBA #include stdio.h Int, main () { Int, I, K, temp; Char str[80]; Printf (input a string:); I = 0; While ((str[i] = getchar ()) = =\n) I++; Str[i] =\0; K = I - 1; For (I = 0; I K; i++) {/ * * / set a breakpoint debugging Temp = str[i]; Str[i] = str[k]; Str[k] = temp; K--; } / * * / set a breakpoint debugging For (I = 0; str[i] = =\0; i++) Putchar (str[i]); Return 0; } Ten point two Enter a string (less than 80 characters) at the end of the carriage return. Convert all the numeric characters (0~9) in the string to integers and remove other characters. If the string 3a56bc is converted to an integer, it is 356. Input sample: 3a56bc Output sample: Three hundred and fifty-six #include stdio.h #include string.h Int main (void) { Int, I, s; Char str[80]; I = 0; While ((str[i] = getchar ()) = =\n) I++; Str[i] =\0; S=0; For (I = 0; str[i]; =\0; i++) If (str[i] =9 str[i] =0) S = s * 10 + (str[i]-0); Printf (%d, s); Return 0; } Ten point three Enter a character and press enter, then a number of # continuous input end of the string (the string length of not more than 80), when all the input end of ##. Find the character in each string and, if found, output the maximum subscript corresponding to the character in the string (subscript starts at 0); otherwise, output Not Found. Example: there is a note in parentheses Input: M (enter a character) Moon#programming#1234## (enter 3 strings, Moon, programming, 1234) Output: 0 (M corresponds to the maximum subscript in Moon is 0) 7 (m in programming) corresponds to a minimum subscript of 7) Not Found (1234 does not have m) #include stdio.h #define MAXLEN 80 Int, main () {int, count, I, K, flag, sub; Char, CC, CH, oldch, str[MAXLEN]; Oldch=; Cc=getchar (); Getchar (); ((ch=getchar) while (=#||oldch) {=#!!) K=0; While (CH k MAXL

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档