Search - INT 1 - CodeBus

Search - INT 1 - List

[Anti-virus] code DL : 0: #include <QMap> #include <QMapIterator> #include <QDebug> int main() { QMap<QString, int> map map["one"] = 1 // insert using the [] operator map["two"] = 2 map.insert("seven", 7) // insert using insert() qDebug() << map["seven"] // read using the [] operator qDebug() << map.value("seven") // read using value() QMapIterator<QString, int> i(map) while (i.hasNext()) { i.next() qDebug() << i.key() << ":" << i.value() } return 0 }-#include <QMap> #include <QMapIterator> #include <QDebug> int main() { QMap<QString, int> map map["one"] = 1 // insert using the [] operator map["two"] = 2 map.insert("seven", 7) // insert using insert() qDebug() << map["seven"] // read using the [] operator qDebug() << map.value("seven") // read using value() QMapIterator<QString, int> i(map) while (i.hasNext()) { i.next() qDebug() << i.key() << ":" << i.value() } return 0 }
Date : 2026-01-07 Size : 7kb User : randex
[Anti-virus] DecisionTree DL : 0: 决策树算法实现，C4.5，挺好的实现了，大家可以下载来-Cnt main(int argc, char* argv[]){ string filename = "source.txt" DecisionTree dt int attr_node = 0 TreeNode* treeHead = nullptr set<int> readLineNum vector<int> readClumNum int deep = 0 if (dt.pretreatment(filename, readLineNum, readClumNum) == 0) { dt.CreatTree(treeHead, dt.getStatTree(), dt.getInfos(), readLineNum, readClumNum, deep) }
Date : 2026-01-07 Size : 4.66mb User : 王生
[Anti-virus] DecisionTree DL : 0: 决策树算法实现，C4.5，挺好的实现了，大家可以下载来-Cnt main(int argc, char* argv[]){ string filename = "source.txt" DecisionTree dt int attr_node = 0 TreeNode* treeHead = nullptr set<int> readLineNum vector<int> readClumNum int deep = 0 if (dt.pretreatment(filename, readLineNum, readClumNum) == 0) { dt.CreatTree(treeHead, dt.getStatTree(), dt.getInfos(), readLineNum, readClumNum, deep) }
Date : 2026-01-07 Size : 4.66mb User : 王生