YangXian

俺也一样？？？感觉每次训练都是独立的？？请问作者运行过模型吗？期待您的回复！

去作者新的仓库吧： https://github.com/chenyuntc/pytorch-book/tree/master/chapter6-%E5%AE%9E%E6%88%98%E6%8C%87%E5%8D%97

my tree file is below, hope it can sovle your problem. 

It means your "dataset.py" is not correct which leads to the error of dataloader. Because the form of your data is not the same as this code. If you can't...

After I delete the ‘.', the code works. But I can't load the pretrained model if I change the model's layer.How to solve this problem?

@aiyolo It's a interesting phenomenon, are datasets stored in the same kind of hard disk? May be your datas store in SSD? By the way, does that mater if the...

现在有置顶功能了吗

找工作，刷题记录 leetcode [77] - 表示写过且一次性过 - [x] 表示已经写过，但是需要复习 - [ ] 表示还没写过 ### LeetCode 周赛 #### 第 178 场周赛 - [x] 5346. 二叉树中的列表 `bfs+dfs` - [ ] 5347. 使网格图至少有一条有效路径的最小代价 `bfs+dfs`...

## unordered_map [[reference]](https://en.cppreference.com/w/cpp/container/unordered_map) ```cpp #include #include #include int main() { // Create an unordered_map of three strings (that map to strings) std::unordered_map u = { {"RED","#FF0000"}, {"GREEN","#00FF00"}, {"BLUE","#0000FF"} }; //...

- [x] 二叉树的下一个结点 [[problem]](https://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) > 给定一个二叉树和其中的一个结点，请找出中序遍历顺序的下一个结点并且返回 > 分为两部分: 如果存在右孩子节点, 那么是右孩子的最左孩子; 如果没有右孩子没有左孩子, 那么是他自己; > 如果没有右孩子, 那么找父节点, 找出第一个非父节点; - [x] 10.斐波那契数列 [[problem]](https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking) > 斐波那契的记忆化优化