cpp:Double Dimensional Array using vector 2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | // StudentArry.h : 此文件包含 "StudentArry" 类。学生数组成绩显示方法 C++ 14 // 2023年4月9日 涂聚文 Geovin Du edit. //(1)vec1.size() 就是”二维数组”的行数 //(2)vec1[0].size() 就是”二维数组”的列数 //vector<vector<double>> geovindu #pragma once #ifndef STUDENTARRY_H #define STUDENTARRY_H #include <iostream> #include <string> #include <vector> #include <memory> #include <iostream> #include <string> #include <ctime> #include <cstdlib> #include <list> #include<algorithm> using namespace std; /** * */ namespace geovindu { /// <summary> /// 学生数组成绩显示方法 /// </summary> class StudentArry { private : public : /// <summary> /// 学生成绩 /// </summary> void displayStudent(); /// <summary> /// 学生成绩 无效 /// </summary> /// <param name="name">学生姓名列表</param> /// <param name="Subject">课程列表</param> /// <param name="ScoreList">分数列表</param> void displayStudent(string name[5], string Subject[5], int ScoreList[5][4]); /// <summary> /// 学生成绩 /// </summary> /// <param name="name">学生姓名列表</param> /// <param name="Subject">课程列表</param> /// <param name="ScoreList">分数列表</param> void displayStudentVector(vector<string> name, vector<string>Subject, vector<vector< int >> ScoreList); /// <summary> /// 获取数组排序的索引列表 /// </summary> /// <param name="sortvecotrs"></param> /// <returns></returns> //vector<int> sort(vector<int> sortvecotrs); /// <summary> /// /// </summary> /// <param name="source"></param> /// <returns></returns> vector< int > setSort(vector< int > source); int getIndex(vector< int > sortvecotrs, int index); }; } #endif |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 | // StudentArry.cpp : //练习案例:学生数组成绩显示方法 StudentArry //案例描述:学生数组成绩显示方法 #include "StudentArry.h" #include <iostream> #include <string> #include <vector> #include <memory> #include <iostream> #include <list> #include<algorithm> using namespace std; /** * @brief * \author geovindu. * \date 20230-4-10 */ namespace geovindu { /// <summary> /// /// </summary> typedef struct { int index; //原索引值 int value; //值 }sort_st; /// <summary> /// /// </summary> /// <param name="a"></param> /// <param name="b"></param> /// <returns></returns> bool compare(sort_st a, sort_st b) { return a.value > b.value; //升序排列,如果改为return a.value<b.value,则为降序 } struct node { double data; int No; }; int comp( const void * a, const void * b) { return (*( struct node*)a).data > (*( struct node*)b).data ? 1 : -1; } /// <summary> /// /// </summary> /// <param name="sortvecotrs"></param> /// <returns></returns> //vector<int> sort(vector<int> sortvecotrs) //{ // //vector <int> temp = sortvecotrs;// { 11, 3, 2, 14 }; // vector <sort_st> sort_array(sortvecotrs.size()); // for (int i = 0; i < sortvecotrs.size(); ++i) { // sort_array[i].index = i; // sort_array[i].value = sortvecotrs[i]; // } // //从小至大 // sort(sort_array.begin(), sort_array.end(), compare); // return sort_array; //} /// <summary> /// 学生成绩 /// 数组用法 /// </summary> void StudentArry::displayStudent() { /// int SubjectScore = 0; // int grossScore = 0; string name[5] = { "张三" , "李四" , "王五" , "涂聚文" , "Geovin" }; const int nameCount = size(name); string Subject[4] = { "语文" , "数学" , "英语" , "物理" }; const int SubjectCount = size(Subject); string strname = "" ; //前人个数nameCount 后分数个数SubjectCount int ScoreList[nameCount][SubjectCount] = { { 100,100,100,99 },{ 90,50,100,60 },{ 60,70,80,77 },{ 10,20,50,17 },{ 60,90,40,87 } }; //表标题 cout << "\t" ; for ( int i = 0; i < SubjectCount; i++) { cout << Subject[i] + "\t" ; } cout << "总分\t名次" ; cout << endl; //求总成绩的数组及排名次 vector < int > temp; //vector<size_t> idx; std::vector< int > du; for ( int i = 0; i < nameCount; i++) { grossScore = 0; //cout << name[i] << "\t"; for ( int j = 0; j < SubjectCount; j++) { //显示行各人成绩 //cout << ScoreList[i][j] << "\t"; grossScore = grossScore + ScoreList[i][j]; } //cout << grossScore << "\t"; //cout << endl; temp.push_back(grossScore); } //du=sort(temp); du=setSort(temp); //内容列表 for ( int i = 0; i < nameCount; i++) { grossScore = 0; cout << name[i] << "\t" ; for ( int j = 0; j < SubjectCount; j++) { cout << ScoreList[i][j] << "\t" ; grossScore = grossScore + ScoreList[i][j]; } cout << grossScore << "\t" ;; int ii = getIndex(du,i); cout << ii; cout << endl; } //求总分和平均分 int sum = 0; int ver[SubjectCount]; cout << "科总分 " ; for ( int i = 0; i < SubjectCount; i++) { SubjectScore = 0; for ( int j = 0; j < nameCount; j++) { SubjectScore = SubjectScore + ScoreList[j][i]; } sum = sum + SubjectScore; ver[i] = SubjectScore / nameCount; cout << SubjectScore << "\t" ; } cout << sum; cout << endl; //显示平均分行 cout << "平均分 " ; for ( int i = 0; i < SubjectCount; i++) { cout << ver[i] << "\t" ; } cout << endl; cout << "***********************************" << endl; /* for (int i = 0; i < 3; i++) { ge = 0; for (int j = 0; j < 3; j++) { ge = ge + chengji[i][j]; } strname = name[i] + to_string(ge); cout << name[i] << "个人总分:" << ge << endl; //cout <<"个人总分:"<< strname << endl; yuwen = 0; for (int j = 0; j < 3; j++) { yuwen = yuwen + chengji[j][i]; } cout << cheng[i] << "课程总分数:" << yuwen << endl; } */ } /// <summary> /// 学生成绩 无效 /// </summary> /// <param name="name">学生姓名列表</param> /// <param name="Subject">课程列表</param> /// <param name="ScoreList">分数列表</param> void StudentArry::displayStudent(string name[5], string Subject[4], int ScoreList[5][4]) { // int SubjectScore = 0; // int grossScore = 0; const int nameCount = sizeof (name); const int SubjectCount = sizeof (Subject); string strname = "" ; //表标题 cout << "\t" ; for ( int i = 0; i < SubjectCount; i++) { cout << Subject[i] + "\t" ; } cout << "总分" ; cout << endl; //内容列表 for ( int i = 0; i < nameCount; i++) { grossScore = 0; cout << name[i] << "\t" ; for ( int j = 0; j < SubjectCount; j++) { cout << ScoreList[i][j] << "\t" ; grossScore = grossScore + ScoreList[i][j]; } cout << grossScore; cout << endl; } //求总分和平均分 int sum = 0; int ver[SubjectCount]; cout << "科总分 " ; for ( int i = 0; i < SubjectCount; i++) { SubjectScore = 0; for ( int j = 0; j < nameCount; j++) { SubjectScore = SubjectScore + ScoreList[j][i]; } sum = sum + SubjectScore; ver[i] = SubjectScore / nameCount; cout << SubjectScore << "\t" ; } cout << sum; cout << endl; //显示分均分行 cout << "平均分 " ; for ( int i = 0; i < SubjectCount; i++) { cout << ver[i] << "\t" ; } cout << endl; cout << "***********************************" << endl; } /// <summary> /// /// </summary> /// <typeparam name="T"></typeparam> /// <param name="v"></param> /// <returns></returns> template < typename T> vector< size_t > sort_indexes( const vector< T>& v) { // initialize original index locations vector< size_t > idx(v.size()); for ( size_t i = 0; i != idx.size(); ++i) idx[i] = i; // sort indexes based on comparing values in v sort(idx.begin(), idx.end(), [&v]( size_t i1, size_t i2) { return v[i1] < v[i2]; }); return idx; } /// <summary> /// /// </summary> /// <param name="sortvecotrs"></param> /// <returns></returns> vector< int > sort(vector< int > sortvecotrs) { vector< int > data = sortvecotrs; vector< int > indexdu(sortvecotrs.size(), 0); for ( int i = 0; i != indexdu.size(); i++) { indexdu[i] = i; } sort(indexdu.begin(), indexdu.end(),[&]( const int & a, const int & b) { return (data[a] < data[b]); } ); //反向排序 //sort(indexdu.rbegin(), indexdu.rend()); //qsort() return indexdu; } /// <summary> /// /// </summary> /// <param name="source"></param> /// <returns></returns> vector< int > StudentArry::setSort(vector< int > source) { //double a[] = { 3.0, 4.0, 2.5,1.1, 5.6 }; /* int n = source.size();// sizeof(a) / sizeof(double); struct node arry[sizeof(source) / sizeof(int)]; int i; for (i = 0; i < n; ++i) { arry[i].data = source[i]; arry[i].No = i; } qsort(arry, n, sizeof(struct node), comp); */ /** * * printf("(当前值,原索引)\n"); for(i = 0; i < n;++i) { cout<<arry[i].data<<"\t"<<a[i]<<"\t"<<arry[i].No<<endl; }. * * \param source * \return */ vector< int > index(source.size(), 0); for ( int i = 0; i != index.size(); i++) { index[i] = i; } sort(index.begin(), index.end(), [&]( const int & a, const int & b) { return (source[a] >source[b]); //< 升 //降 } ); return index; } /// <summary> /// 根据原索引值得到排名次 /// </summary> /// <param name="sortvecotrs"></param> /// <param name=""></param> /// <returns></returns> int StudentArry::getIndex(vector< int > sortvecotrs, int index) { int ii = 0; for ( int i = 0; i != sortvecotrs.size(); i++) { if (sortvecotrs[i] == index) { ii = i + 1; } //cout <<"索引值:" << sortvecotrs[i] << " 名次:" << i + 1 << endl; } return ii; } /// <summary> /// 学生成绩 vector容器 /// </summary> /// <param name="name">学生姓名列表</param> /// <param name="Subject">课程列表</param> /// <param name="ScoreList">分数列表</param> void StudentArry::displayStudentVector(vector<string> name, vector<string>Subject, vector<vector< int >> ScoreList) { // int SubjectScore = 0; // int grossScore = 0; const int nameCount = name.size(); const int SubjectCount = Subject.size(); //const int vCout = SubjectCount;// Subject.size(); const int geovindu= Subject.size(); string strname = "" ; //表标题 cout << "\t" ; for ( int i = 0; i < SubjectCount; i++) { cout << Subject[i] + "\t" ; } cout << "总分\t名次" ; cout << endl; //求总成绩的数组及排名次 vector < int > temp; //vector<size_t> idx; std::vector< int > du; for ( int i = 0; i < nameCount; i++) { grossScore = 0; //cout << name[i] << "\t"; for ( int j = 0; j < SubjectCount; j++) { //显示行各人成绩 //cout << ScoreList[i][j] << "\t"; grossScore = grossScore + ScoreList[i][j]; } //cout << grossScore << "\t"; //cout << endl; temp.push_back(grossScore); } //du=sort(temp); du = setSort(temp); //内容列表 for ( int i = 0; i < nameCount; i++) { grossScore = 0; cout << name[i] << "\t" ; for ( int j = 0; j < SubjectCount; j++) { //显示行各人成绩 cout << ScoreList[i][j] << "\t" ; grossScore = grossScore + ScoreList[i][j]; } cout << grossScore << "\t" ; int ii = getIndex(du, i); cout << ii; cout << endl; } //增加行 //求总分和平均分 int sum = 0; const int vcout = Subject.size(); int * verScore = new int [vcout]; cout << "科总分 " ; for ( int i = 0; i < SubjectCount; i++) { SubjectScore = 0; for ( int j = 0; j < nameCount; j++) { SubjectScore = SubjectScore + ScoreList[j][i]; } sum = sum + SubjectScore; verScore[i] = SubjectScore / nameCount; cout << SubjectScore << "\t" ; } cout << sum; cout << endl; //显示分均分行 cout << "平均分 " ; for ( int i = 0; i < SubjectCount; i++) { cout << verScore[i] << "\t" ; } cout << endl; cout << "**vector容器*********************************" << endl; } } |
存储在text文件中的中文需要考虑转码问题。
程序文件编码为BGK和text文件编码为ANSI解决
解决中文CIN,WCIN输入问题。已经解决输入输出问题
错误 C4996 'fopen': This function or variable may be unsafe. Consider using fopen_s instead. To disable deprecation, use _CRT_SECURE_NO_WARNINGS. See online help for details. ConsoleTextFileDemoApp C:\Users\geovindu\Documents\Visual Studio 2022\Project\ConsoleTextFileDemoApp\FileHelper.cpp 75
首行加入: #define _CRT_SECURE_NO_WARNINGS
哲学管理(学)人生, 文学艺术生活, 自动(计算机学)物理(学)工作, 生物(学)化学逆境, 历史(学)测绘(学)时间, 经济(学)数学金钱(理财), 心理(学)医学情绪, 诗词美容情感, 美学建筑(学)家园, 解构建构(分析)整合学习, 智商情商(IQ、EQ)运筹(学)生存.---Geovin Du(涂聚文)
分类:
Cpp programming
标签:
vector
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 25岁的心里话
· 闲置电脑爆改个人服务器(超详细) #公网映射 #Vmware虚拟网络编辑器
· 基于 Docker 搭建 FRP 内网穿透开源项目(很简单哒)
· 零经验选手,Compose 一天开发一款小游戏!
· 一起来玩mcp_server_sqlite,让AI帮你做增删改查!!
2017-04-18 FullCalendar:eventColor,eventBackgroundColor, eventBorderColor, and eventTextColor