文件名称:hangman
-
所属分类:
- 标签属性:
- 上传时间:2017-04-18
-
文件大小:1.04kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
字符串或串(String)是由数字、字母、下划线组成的一串字符。一般记为 s “a1a2···an”(n> 0)。它是编程语言中表示文本的数据类型。在程序设计中,字符串(string)为符号或数值的一个连续序列,如符号串(一串字符)或二进制数字串(一串二进制数字)。
通常以串的整体作为操作对象,如:在串中查找某个子串、求取一个子串、在串的某个位置上插入一个子串以及删除一个子串等。两个字符串相等的充要条件是:长度相等,并且各个对应位置上的字符都相等。设p、q是两个串,求q在p中首次出现的位置的运算叫做模式匹配。串的两种最基本的存储方式是顺序存储方式和链接存储方式。-Strings or string (String) is a string of characters consisting of numbers, letters, the underscore. Is generally referred to as s " a1a2an" (n> 0). It is a programming language indicates the data type of text. In programming, a string (string) is a symbol or a continuous numerical sequence, such as a symbol string (string of characters) or binary digit string (a string of binary digits). Typically whole string as the operation target, such as: Find a substring in the string, a substring is obtained, inserting a substring of string in a certain position on a sub-string and deleting the like. Sufficient Conditions two strings are equal: equal length, and the character corresponding to the respective positions are equal. Provided p, q are two strings, the first occurrence of q seek operation in the p position is called pattern matching. Two basic ways to store strings of sequential storage and links stored.
通常以串的整体作为操作对象,如:在串中查找某个子串、求取一个子串、在串的某个位置上插入一个子串以及删除一个子串等。两个字符串相等的充要条件是:长度相等,并且各个对应位置上的字符都相等。设p、q是两个串,求q在p中首次出现的位置的运算叫做模式匹配。串的两种最基本的存储方式是顺序存储方式和链接存储方式。-Strings or string (String) is a string of characters consisting of numbers, letters, the underscore. Is generally referred to as s " a1a2an" (n> 0). It is a programming language indicates the data type of text. In programming, a string (string) is a symbol or a continuous numerical sequence, such as a symbol string (string of characters) or binary digit string (a string of binary digits). Typically whole string as the operation target, such as: Find a substring in the string, a substring is obtained, inserting a substring of string in a certain position on a sub-string and deleting the like. Sufficient Conditions two strings are equal: equal length, and the character corresponding to the respective positions are equal. Provided p, q are two strings, the first occurrence of q seek operation in the p position is called pattern matching. Two basic ways to store strings of sequential storage and links stored.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
hangman.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.