博客园 - tangq123
uuid:24b78886-0ed1-41c2-8670-e3f31dcf42c4;id=52430
2022-09-18T10:46:29Z
tangq123
https://www.cnblogs.com/keep23456/
feed.cnblogs.com
https://www.cnblogs.com/keep23456/p/16705462.html
先序遍历建立和打印二叉树,中序遍历线索化和打印中序线索二叉树,删除中序线索二叉树的某个结点 - tangq123
转载本人原创https://blog.csdn.net/weixin_40625079/article/details/97974646?spm=1001.2014.3001.5502
2022-09-18T10:46:00Z
2022-09-18T10:46:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】转载本人原创https://blog.csdn.net/weixin_40625079/article/details/97974646?spm=1001.2014.3001.5502 <a href="https://www.cnblogs.com/keep23456/p/16705462.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/14628050.html
期末预测之最佳阈值 - tangq123
1 #include<bits/stdc++.h> 2 using namespace std; 3 4 struct node { 5 int y,result; 6 }; 7 vector<node> nodes; 8 9 bool cmp(node &a,node &b) { 10 if(a.
2021-04-07T07:42:00Z
2021-04-07T07:42:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】1 #include<bits/stdc++.h> 2 using namespace std; 3 4 struct node { 5 int y,result; 6 }; 7 vector<node> nodes; 8 9 bool cmp(node &a,node &b) { 10 if(a. <a href="https://www.cnblogs.com/keep23456/p/14628050.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/13782356.html
从RNN到LSTM,全是转载,笑哭 - tangq123
https://blog.csdn.net/v_JULY_v/article/details/89894058
2020-10-08T11:18:00Z
2020-10-08T11:18:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】https://blog.csdn.net/v_JULY_v/article/details/89894058 <a href="https://www.cnblogs.com/keep23456/p/13782356.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/13662573.html
深度学习之参数更新方法(全是转载,哭笑) - tangq123
https://blog.csdn.net/u012328159/article/details/80311892 https://zhuanlan.zhihu.com/p/21486826 http://www.mamicode.com/info-detail-1931210.html 推荐看这个
2020-09-13T11:03:00Z
2020-09-13T11:03:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】https://blog.csdn.net/u012328159/article/details/80311892 https://zhuanlan.zhihu.com/p/21486826 http://www.mamicode.com/info-detail-1931210.html 推荐看这个 <a href="https://www.cnblogs.com/keep23456/p/13662573.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/13541562.html
python中矩阵与数组相乘的问题(转载) - tangq123
转载自 https://blog.csdn.net/weixin_43069755/article/details/88209967 下文探究一下在神经网络中可能会遇到的np.dot(数组,矩阵)和np.dot(矩阵,数组)等矩阵与数组相乘的问题: (1) np.dot(数组,矩阵): import
2020-08-21T08:04:00Z
2020-08-21T08:04:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】转载自 https://blog.csdn.net/weixin_43069755/article/details/88209967 下文探究一下在神经网络中可能会遇到的np.dot(数组,矩阵)和np.dot(矩阵,数组)等矩阵与数组相乘的问题: (1) np.dot(数组,矩阵): import <a href="https://www.cnblogs.com/keep23456/p/13541562.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/13468641.html
计算方法之非线性方程(组)的求解 - tangq123
https://blog.csdn.net/wu_nan_nan/article/details/53335554?spm=1001.2101.3001.4242 非奇异矩阵 也称 可逆矩阵
2020-08-10T03:12:00Z
2020-08-10T03:12:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】https://blog.csdn.net/wu_nan_nan/article/details/53335554?spm=1001.2101.3001.4242 非奇异矩阵 也称 可逆矩阵 <a href="https://www.cnblogs.com/keep23456/p/13468641.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/13262735.html
1007 Maximum Subsequence Sum - tangq123
原题链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805514284679168 1 #include<iostream> 2 #include<vector> 3 using namespace std; 4 5
2020-07-07T11:34:00Z
2020-07-07T11:34:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】原题链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805514284679168 1 #include<iostream> 2 #include<vector> 3 using namespace std; 4 5 <a href="https://www.cnblogs.com/keep23456/p/13262735.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12580728.html
1101 Quick Sort(二刷) - tangq123
英文题目:1101 Quick Sort 中文题目:1045 快速排序 主元判断方法:如果一个元素大于等于其左边所有元素的最大值,小于等于其右边所有元素的最小值,那么这个元素可能是主元。 1 #include<iostream> 2 #include<algorithm> 3 using names
2020-03-27T05:12:00Z
2020-03-27T05:12:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】英文题目:1101 Quick Sort 中文题目:1045 快速排序 主元判断方法:如果一个元素大于等于其左边所有元素的最大值,小于等于其右边所有元素的最小值,那么这个元素可能是主元。 1 #include<iostream> 2 #include<algorithm> 3 using names <a href="https://www.cnblogs.com/keep23456/p/12580728.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12580692.html
1100 Mars Numbers(二刷) - tangq123
英文题目:1100 Mars Numbers 中文题目:1044 火星数字 1 #include<iostream> 2 #include<algorithm> 3 using namespace std; 4 string hashtable1[13] = {"tret","jan", "feb"
2020-03-27T05:05:00Z
2020-03-27T05:05:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】英文题目:1100 Mars Numbers 中文题目:1044 火星数字 1 #include<iostream> 2 #include<algorithm> 3 using namespace std; 4 string hashtable1[13] = {"tret","jan", "feb" <a href="https://www.cnblogs.com/keep23456/p/12580692.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12580665.html
1105 Spiral Matrix(二刷) - tangq123
英文题目:1105 Spiral Matrix 中文题目:1050 螺旋矩阵 1 #include<iostream> 2 #include<vector> 3 #include<algorithm> 4 #include<cmath> 5 using namespace std; 6 7 int
2020-03-27T04:59:00Z
2020-03-27T04:59:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】英文题目:1105 Spiral Matrix 中文题目:1050 螺旋矩阵 1 #include<iostream> 2 #include<vector> 3 #include<algorithm> 4 #include<cmath> 5 using namespace std; 6 7 int <a href="https://www.cnblogs.com/keep23456/p/12580665.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12580495.html
1104 Sum of Number Segments(二刷) - tangq123
英文题目:1104 Sum of Number Segments 中文题目:1049 数列的片段和 1 #include<iostream> 2 using namespace std; 3 4 int main() { 5 int n; 6 double t,sum = 0; 7 cin>>n;
2020-03-27T04:12:00Z
2020-03-27T04:12:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】英文题目:1104 Sum of Number Segments 中文题目:1049 数列的片段和 1 #include<iostream> 2 using namespace std; 3 4 int main() { 5 int n; 6 double t,sum = 0; 7 cin>>n; <a href="https://www.cnblogs.com/keep23456/p/12580495.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12575228.html
1123 Is It a Complete AVL Tree(平衡二叉树、完全二叉树) - tangq123
题目:1123 Is It a Complete AVL Tree 该题目综合了:1066 Root of AVL Tree与1110 Complete Binary Tree。 大致题意:给出一个包含N个元素的序列,构建一个平衡二叉树,然后判断其是否是一棵完全二叉树。 思路分析:先用七步口决构建平
2020-03-26T09:23:00Z
2020-03-26T09:23:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】题目:1123 Is It a Complete AVL Tree 该题目综合了:1066 Root of AVL Tree与1110 Complete Binary Tree。 大致题意:给出一个包含N个元素的序列,构建一个平衡二叉树,然后判断其是否是一棵完全二叉树。 思路分析:先用七步口决构建平 <a href="https://www.cnblogs.com/keep23456/p/12575228.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12575132.html
1066 Root of AVL Tree(平衡二叉树/自平衡二叉查找树/AVL树) - tangq123
题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805404939173888 大致题意就是给出一个包含N个元素的序列,构建一个平衡二叉树,然后输出根结点上的元素。 这是一道模板题,要记住大体流程,然后反复练习。 PS
2020-03-26T08:13:00Z
2020-03-26T08:13:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805404939173888 大致题意就是给出一个包含N个元素的序列,构建一个平衡二叉树,然后输出根结点上的元素。 这是一道模板题,要记住大体流程,然后反复练习。 PS <a href="https://www.cnblogs.com/keep23456/p/12575132.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12567672.html
1107 Social Clusters(二刷) - tangq123
题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805361586847744 1 #include<iostream> 2 #include<vector> 3 #include<map> 4 #include<al
2020-03-25T09:45:00Z
2020-03-25T09:45:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805361586847744 1 #include<iostream> 2 #include<vector> 3 #include<map> 4 #include<al <a href="https://www.cnblogs.com/keep23456/p/12567672.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12567020.html
1106 Lowest Price in Supply Chain(二刷) - tangq123
题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805362341822464 大致题意就是求叶子节点的最小点权,并统计其个数。 一刷:1106 Lowest Price in Supply Chain 1 #incl
2020-03-25T08:29:00Z
2020-03-25T08:29:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805362341822464 大致题意就是求叶子节点的最小点权,并统计其个数。 一刷:1106 Lowest Price in Supply Chain 1 #incl <a href="https://www.cnblogs.com/keep23456/p/12567020.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12566751.html
1109 Group Photo - tangq123
英文题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805360043343872 中文题目:https://pintia.cn/problem-sets/994805260223102976/problems/994
2020-03-25T07:56:00Z
2020-03-25T07:56:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】英文题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805360043343872 中文题目:https://pintia.cn/problem-sets/994805260223102976/problems/994 <a href="https://www.cnblogs.com/keep23456/p/12566751.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12566452.html
1108 Finding Average(考察sscanf和sprintf) - tangq123
英文题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805360777347072 中文题目:https://pintia.cn/problem-sets/994805260223102976/problems/994
2020-03-25T07:17:00Z
2020-03-25T07:17:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】英文题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805360777347072 中文题目:https://pintia.cn/problem-sets/994805260223102976/problems/994 <a href="https://www.cnblogs.com/keep23456/p/12566452.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12556726.html
1119 Pre- and Post-order Traversals (先序+后序 =(非唯一) 二叉树) - tangq123
题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805353470869504 题目大意: 给出一棵树的结点个数n,以及它的前序遍历和后序遍历,输出它的中序遍历,如果中序遍历不唯一就输出No,且输出其中一个中序即可,如
2020-03-24T01:51:00Z
2020-03-24T01:51:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805353470869504 题目大意: 给出一棵树的结点个数n,以及它的前序遍历和后序遍历,输出它的中序遍历,如果中序遍历不唯一就输出No,且输出其中一个中序即可,如 <a href="https://www.cnblogs.com/keep23456/p/12556726.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12545489.html
1111 Online Map(迪杰斯特拉+DFS) - tangq123
题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805358663417856 输出要求: 翻译结果: 在最短路径不唯一的情况下,输出最短路径中最快的一条,保证唯一。 如果最快的路径不是唯一的,则输出通过最少交叉口的路
2020-03-22T05:03:00Z
2020-03-22T05:03:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805358663417856 输出要求: 翻译结果: 在最短路径不唯一的情况下,输出最短路径中最快的一条,保证唯一。 如果最快的路径不是唯一的,则输出通过最少交叉口的路 <a href="https://www.cnblogs.com/keep23456/p/12545489.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/keep23456/p/12544224.html
1114 Family Property(并查集) - tangq123
题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805356599820288 题目比较麻烦,因为限时200ms,所以要用散列。 1 #include<iostream> 2 #include<vector> 3 #i
2020-03-22T02:00:00Z
2020-03-22T02:00:00Z
tangq123
https://www.cnblogs.com/keep23456/
【摘要】题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805356599820288 题目比较麻烦,因为限时200ms,所以要用散列。 1 #include<iostream> 2 #include<vector> 3 #i <a href="https://www.cnblogs.com/keep23456/p/12544224.html" target="_blank">阅读全文</a>