zoukankan      html  css  js  c++  java
  • C++基本语法

    七种基本数据类型
    类型 关键字
    布尔型 bool
    字符型 char
    整型 int
    浮点型 float
    双浮点型 double
    无类型 void
    宽字符型 wchar_t
    #include<iostream>  
    #include<string>  
    #include <limits>  
    using namespace std;  
      
    int main()  
    {  
        cout << "type: 		" << "************size**************"<< endl;  
        cout << "bool: 		" << "所占字节数:" << sizeof(bool);  
        cout << "	最大值:" << (numeric_limits<bool>::max)();  
        cout << "		最小值:" << (numeric_limits<bool>::min)() << endl;  
        cout << "char: 		" << "所占字节数:" << sizeof(char);  
        cout << "	最大值:" << (numeric_limits<char>::max)();  
        cout << "		最小值:" << (numeric_limits<char>::min)() << endl;  
        cout << "signed char: 	" << "所占字节数:" << sizeof(signed char);  
        cout << "	最大值:" << (numeric_limits<signed char>::max)();  
        cout << "		最小值:" << (numeric_limits<signed char>::min)() << endl;  
        cout << "unsigned char: 	" << "所占字节数:" << sizeof(unsigned char);  
        cout << "	最大值:" << (numeric_limits<unsigned char>::max)();  
        cout << "		最小值:" << (numeric_limits<unsigned char>::min)() << endl;  
        cout << "wchar_t: 	" << "所占字节数:" << sizeof(wchar_t);  
        cout << "	最大值:" << (numeric_limits<wchar_t>::max)();  
        cout << "		最小值:" << (numeric_limits<wchar_t>::min)() << endl;  
        cout << "short: 		" << "所占字节数:" << sizeof(short);  
        cout << "	最大值:" << (numeric_limits<short>::max)();  
        cout << "		最小值:" << (numeric_limits<short>::min)() << endl;  
        cout << "int: 		" << "所占字节数:" << sizeof(int);  
        cout << "	最大值:" << (numeric_limits<int>::max)();  
        cout << "	最小值:" << (numeric_limits<int>::min)() << endl;  
        cout << "unsigned: 	" << "所占字节数:" << sizeof(unsigned);  
        cout << "	最大值:" << (numeric_limits<unsigned>::max)();  
        cout << "	最小值:" << (numeric_limits<unsigned>::min)() << endl;  
        cout << "long: 		" << "所占字节数:" << sizeof(long);  
        cout << "	最大值:" << (numeric_limits<long>::max)();  
        cout << "	最小值:" << (numeric_limits<long>::min)() << endl;  
        cout << "unsigned long: 	" << "所占字节数:" << sizeof(unsigned long);  
        cout << "	最大值:" << (numeric_limits<unsigned long>::max)();  
        cout << "	最小值:" << (numeric_limits<unsigned long>::min)() << endl;  
        cout << "double: 	" << "所占字节数:" << sizeof(double);  
        cout << "	最大值:" << (numeric_limits<double>::max)();  
        cout << "	最小值:" << (numeric_limits<double>::min)() << endl;  
        cout << "long double: 	" << "所占字节数:" << sizeof(long double);  
        cout << "	最大值:" << (numeric_limits<long double>::max)();  
        cout << "	最小值:" << (numeric_limits<long double>::min)() << endl;  
        cout << "float: 		" << "所占字节数:" << sizeof(float);  
        cout << "	最大值:" << (numeric_limits<float>::max)();  
        cout << "	最小值:" << (numeric_limits<float>::min)() << endl;  
        cout << "size_t: 	" << "所占字节数:" << sizeof(size_t);  
        cout << "	最大值:" << (numeric_limits<size_t>::max)();  
        cout << "	最小值:" << (numeric_limits<size_t>::min)() << endl;  
        cout << "string: 	" << "所占字节数:" << sizeof(string) << endl;  
        // << "	最大值:" << (numeric_limits<string>::max)() << "	最小值:" << (numeric_limits<string>::min)() << endl;  
        cout << "type: 		" << "************size**************"<< endl;  
        return 0;  
    }  
    
    
    C++对以null结尾的字符串
    序号 函数 & 目的
    1 strcpy(s1, s2);复制字符串 s2 到字符串 s1。
    2 strcat(s1, s2);连接字符串 s2 到字符串 s1 的末尾。
    3 strlen(s1);返回字符串 s1 的长度。
    4 strcmp(s1, s2);如果 s1 和 s2 是相同的,则返回 0;如果 s1<s2 则返回值小于 0;如果 s1>s2 则返回值大于 0。
    5 strchr(s1, ch);返回一个指针,指向字符串 s1 中字符 ch 的第一次出现的位置。
    6 strstr(s1, s2);返回一个指针,指向字符串 s1 中字符串 s2 的第一次出现的位置。
  • 相关阅读:
    web前端开发(4)
    web前端开发(3)
    web前端开发(2)
    【计算机算法设计与分析】——SVM
    【计算机算法与分析】——7.1分枝-限界法
    【模式识别与机器学习】——判别式和产生式模型
    【模式识别与机器学习】——logistic regression
    【模式识别与机器学习】——最小二乘回归
    【模式识别与机器学习】——似然函数
    【计算机算法设计与分析】——6.4图的着色
  • 原文地址:https://www.cnblogs.com/fuunnyy/p/12849186.html
Copyright © 2011-2022 走看看