C++基础语法入门
1.水仙花数
每个位上的数字的三次幂之和相加等于这个数,如153=13+33+53。
个位:153%10
十位:153/10%10
百位:153/10/10
2.跳转语句goto
语法:goto标记。若标记存在,执行到goto语句时,跳转到标记
goto FLAG;
…
FLAG:
…;
3.一维数组名用途
//(1)可以统计整个数组在内存中的长度
int arr[10];
cout<<"整个数组所占内存空间:“<<sizeof(arr)<<endl;
cout<<"每个元素所占内存空间:”<<sizeof(arr[0])<<endl;
cout<<"数组的元素个数:“<<sizeof(arr)/sizeof(arr[0])<<endl;
//(2)可以获取数组元素在内存中的首地址
cout<<"元素首地址:”<<(int)arr<<endl;
cout<<"数组中第一个元素的首地址:“<<(int)&arr[0]<<endl;
//arr=100;//数组名是常量,不可以赋值
4.一维数组元素逆置
int start=0; //起始元素下标
int end=sizeof(arr)/sizeof(arr[0])-1;//末尾元素下标
5.冒泡排序
(1)比较相邻的元素,若第一个比第二个大,就交换他们两个
(2)对每一对相邻的元素重复相同的工作,执行完毕后找到第一个最大值
(3)重复以上步骤,每次比较次数-1,直到不需要比较。
排序总轮数=元素个数-1
每轮排序次数:元素个数-排序轮数-1
int arr[n];
for(int i=0;i<n-1;i++)
{
for(int j=0;j<n-i-1;j++)
{
if(arr[j]>arr[j+1])
{
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
6.二维数组数组名
//(1)查看二维数组所占内存空间
int arr[][];
cout<<"二维数组大小:”<<sizeof(arr)<<endl;
cout<<"二维数组一行大小:“<<sizeof(arr[0])<<endl;
cout<<"二维数组一个元素大小:”<<sizeof(arr[i][j])<<endl;
cout<<"二维数组行数:'<<sizeof(arr)/sizeof(arr[0])<<endl;
cout<<"二维数组列数:"<<sizeof(arr[0])/sizeof(arr[0][0])<<endl;
//(2)查看二维数组的首地址
cout<<"二维数组首地址:"<<(int)arr<<endl;
cout<<"二维数组第一行首地址:"<<(int)arr[0]<<endl;
cout<<"二维数组第二行首地址:"<<(int)arr[1]<<endl;
cout<<"二维数组第一个元素地址:"<<(int)arr[0][0]<<endl;
7.函数的分文件编写
作用:让代码更加清晰
环境:Visual Studio 6.0
(1)创建后缀名为.h的头文件
(2)创建后缀名为.c pp的源文件
(3)在头文件中写函数的声明
(4)在源文件中写函数的定义
8.指针所占内存空间
在32位操作系统中:占用4个字节
在64位操作系统中:占用8个字节
9.结构体
//语法:
struct 结构体名{
结构体成员列表
};
struct Student{
string name;
int age;
int score;
};
struct Student s1;
s1.name="sdas";
s1.age=12;
s1.score=122;
struct Student s2={"ada",12,233};
10.结构体数组
作用:将自定义的结构体的放到数组中,方便维护
语法:
struct Student stuArray[8]=
{
{ ... },{....},{...}
}
11.结构体指针
利用成员操作符->实现结构体属性
struct Student s={"张三",12,123};
student *p=&s; //通过指针指向结构体变量
cout<<"姓名:"<<p->name;
12.结构体中const使用场景
void printStu(const Student s) //防止误操作
13.随机数
在方法中定义随机数int random=rand()%61+40;//40-100
在头文件中写入 #include <ctime>
在主函数中写 srand((unsiged int)time(NULL));
14.通讯录管理系统
#include<iostream>
#include<string>
using namespace std;
void showMenu()
{
cout << "********************************" << endl;
cout << "********* 1.添加联系人 *********" << endl;
cout << "********* 2.显示联系人 *********" << endl;
cout << "********* 3.删除联系人 *********" << endl;
cout << "********* 4.查找联系人 *********" << endl;
cout << "********* 5.修改联系人 *********" << endl;
cout << "********* 6.清空联系人 *********" << endl;
cout << "********* 0.退出通讯录 *********" << endl;
cout << "********************************" << endl;
}
struct Person
{
string m_name;
int m_Sex;
int m_Age;
string m_Phone;
string m_Addr;
};
#define MAX 1000
struct AddressBooks
{
struct Person personArray[MAX];
int m_Size;
};
void addPerson(AddressBooks* abs)
{
//判断通讯录是否已满
if (abs->m_Size == MAX)
{
cout << "通讯录已满,无法添加!" << endl;
return;
}
else
{
string name;
cout << "请输入姓名:" << endl;
cin >> name;
abs->personArray[abs->m_Size].m_name = name;
int sex;
cout << "请输入性别,1代表男,2代表女:" << endl;
while (true)
{
cin >> sex;
if (sex == 1 || sex == 2)
{
abs->personArray[abs->m_Size].m_Sex = sex;
break;
}
cout << "输入有误,请重新输入!" << endl;
}
int age;
cout << "请输入年龄:" << endl;
cin >> age;
abs->personArray[abs->m_Size].m_Age = age;
string phone;
cout << "请输入联系电话:" << endl;
cin >> phone;
abs->personArray[abs->m_Size].m_Phone = phone;
string addr;
cout << "请输入住址:" << endl;
cin >> addr;
abs->personArray[abs->m_Size].m_Addr = addr;
abs->m_Size++;
cout << "添加成功!" << endl;
system("pause");//按任意键继续
system("cls");//清屏
}
}
void printPerson(AddressBooks* abs)
{
if (abs->m_Size == 0)
{
cout << "通讯录为空!" << endl;
return;
}
else
{
for (int i = 0; i < abs->m_Size; i++)
{
cout << "姓名:" << abs->personArray[i].m_name
<< " 性别:" << (abs->personArray[i].m_Sex==1?"男":"女")
<< " 年龄:" << abs->personArray[i].m_Age
<< " 电话:" << abs->personArray[i].m_Phone
<< " 住址:" << abs->personArray[i].m_Addr << endl;
}
}
}
//检测联系人是否存在,若存在返回具体位置,否=否则返回-1
int isExist(AddressBooks* abs, string name)
{
for (int i = 0; i < abs->m_Size;i++)
{
if (abs->personArray[i].m_name == name)
{
return i;
}
}
return -1;
}
void deletePerson(AddressBooks* abs)
{
string name;
cout << "输入你要删除的姓名:" << endl;
cin >> name;
int ret=isExist(abs, name);
if (ret != -1)
{
for (int i = ret; i < abs->m_Size; i++)
{
abs->personArray[i] = abs->personArray[i + 1];
}
abs->m_Size--;
cout << "删除成功!" << endl;
}
else
{
cout << "查无此人!" << endl;
}
system("pause");
system("cls");
}
void selectPerson(AddressBooks* abs)
{
string name;
cout << "请输入你要查找的联系人的姓名:" << endl;
cin >> name;
int ret = isExist(abs, name);
if (ret != -1)
{
cout << "姓名:" << abs->personArray[ret].m_name
<< " 性别:" << (abs->personArray[ret].m_Sex == 1 ? "男" : "女")
<< " 年龄:" << abs->personArray[ret].m_Age
<< " 电话:" << abs->personArray[ret].m_Phone
<< " 住址:" << abs->personArray[ret].m_Addr << endl;
}
else
{
cout << "查无此人!" << endl;
}
system("pause");
system("cls");
}
void modifyPerson(AddressBooks* abs)
{
string name;
cout << "请输入你要修改的联系人姓名:";
cin >> name;
int ret = isExist(abs, name);
if (ret != -1)
{
string name;
cout << "请输入姓名:" << endl;
cin >> name;
abs->personArray[ret].m_name = name;
int sex;
cout << "请输入性别,1代表男,2代表女:" << endl;
while (true)
{
cin >> sex;
if (sex == 1 || sex == 2)
{
abs->personArray[ret].m_Sex = sex;
break;
}
cout << "输入有误,请重新输入!" << endl;
}
int age;
cout << "请输入年龄:" << endl;
cin >> age;
abs->personArray[ret].m_Age = age;
string phone;
cout << "请输入联系电话:" << endl;
cin >> phone;
abs->personArray[ret].m_Phone = phone;
string addr;
cout << "请输入住址:" << endl;
cin >> addr;
abs->personArray[ret].m_Addr = addr;
cout << "修改成功!" << endl;
}
else
{
cout << "查无此人!" << endl;
}
system("pause");
system("cls");
}
void cleanPerson(AddressBooks* abs)
{
abs->m_Size = 0;
cout << "清空成功!" << endl;
system("pause");
system("cls");
}
int main()
{
AddressBooks abs;
abs.m_Size = 0;
int select=0 ;
//菜单的调用
while (true) {
showMenu();
cout << "请输入编号,选择您的需求:" << endl;
cin >> select;
switch (select)
{
case 1:
addPerson(&abs);
break;
case 2:
printPerson(&abs);
break;
case 3:
deletePerson(&abs);
break;
case 4:
selectPerson(&abs);
break;
case 5:
modifyPerson(&abs);
break;
case 6:
cleanPerson(&abs);
break;
case 0:
cout << "欢迎下次使用" << endl;
system("pause");
return 0;
break;
default:
break;
}
}
system("pause");
return 0;
}