SmartDemo的博客

【代码】排序算法c++实现。

【代码】求最大公因子GCD。

环：jupyter(tensorflow)其中：mi.png是网上下载的size =（521，396，3）的 人物图片 最终效果：参考：SVD（奇异值分解）Python实现 - EndlessCoding - 博客园 (cnblogs.com)

#include<iostream>#include<vector>#include<map>#include<algorithm>#include<sstream>#include<queue>using namespace std;struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode() : val(.

可以说是相当简洁粗暴了。#include<iostream>#include<algorithm>using namespace std;struct Node{ int val; Node *left,*right; Node(int x):val(x),left(NULL),right(NULL){}};int height(Node* root){ if(root == NULL) return 0; return ma.

#include<iostream>using namespace std;struct Node { int val; Node* next; Node() :val(0), next(NULL) {} Node(int v) :val(v), next(NULL) {}};Node* reverseNeighbor(Node* head) { Node* dummy = new Node(); dummy->next = h.

#include<iostream>using namespace std;struct Node{ int val; Node* next; Node(int v):val(v),next(NULL){}};Node * reverseList(Node* head){ Node* pre = NULL; Node* cur = head; Node* cnext = NULL; while(cur){ cn.

一、头插法#include<iostream>using namespace std;struct ListNode { int val; ListNode* next; ListNode() : val(0), next(nullptr) {} ListNode(int x) : val(x), next(nullptr) {} ListNode(int x, ListNode* next) : val(x), next(next) {}};ListNode* Ins

一、第一种#include<iostream>#include<vector>#include<algorithm>using namespace std;struct Node{ Node* left; Node* right; int val; Node(int v):left(nullptr),right(nullptr),val(v){} Node(Node* l,Node* r,int v):left(l)

一、排列#include<iostream>#include<vector>using namespace std;class Solution{private: int n; vector<vector<int>> ans; vector<int> vis;public: void dfs1(vector<int> &nums,vector<int>&c).

一、迷宫随机生成算法 : dfsimport numpy as npimport randomfrom matplotlib import pyplot as pltimport matplotlib.cm as cmnum_rows = 10num_cols = 10# M = [L,U,R,D,VIS]M = []r = 0c = 0M = np.zeros((num_rows,num_cols,5),dtype=np.uint8)image = np.zeros((nu

def DFS(graph,s): st = [] st.append(s) seen = set() seen.add(s) while st: vertex = st.pop() #此时栈顶元素出栈 datas = graph[vertex] for data in datas: if data not in seen: seen.add(data) st.append(data) print(vertex)def BFS(grap.

#include<iostream>#include<vector>#include<sstream>using namespace std; struct Node{ int value; Node* left; Node* right; Node(){value = 0,left = NULL;right = NULL;} Node(int val):value(val),left(NULL),right(NULL).

//count the num of words#include<iostream>using namespace std; unsigned countWords(string str) { unsigned int wc = 0; bool flag = true; for(char c:str){ cout<<c<<endl; if(c == ' ' || c == '\t' || c == '\.

参考链接：python实现：https://lips.cs.princeton.edu/the-alias-method-efficient-sampling-with-many-discrete-outcomes/ 算法思想：https://www.keithschwarz.com/darts-dice-coins/ 思想简单介绍：https://blog.youkuaiyun.com/qq_33765907/article/details/79182355 各版本代码实现：https://blog.csd

一、topk_堆排#include<iostream>#include<vector>#include<algorithm>//堆排序using namespace std;void Swap(vector<int>& tree, int a, int b) { int temp = tree[a]; tree[a] = tree[b]; tree[b] = temp;}void heapify(vector<int.

#include<iostream>using namespace std;struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {}}; class Solution {public: ListNode* reverseList(ListNode* l) { ListNode* pre = NULL, * temp = NU.

#include<iostream>#define MAX_LEN 1000using namespace std;//int node = 0:从根节点开始建树void buid_tree(int arr[], int tree[], int node, int start, int end) { if (start == end) { tree[node] = arr[start]; } else { int left_node = 2 * node + 1; .

#include<iostream>using namespace std;//堆满足两个要求：//1、完全二叉树//2、parent>childvoid swap(int tree[],int i, int j) { int temp = tree[i]; tree[i] = tree[j]; tree[j] = temp;}void heapify(int tree[], int n,int i){ if (i >= n) return; int .

#include<iostream>#include<vector>#include<algorithm>using namespace std;typedef pair<int, int> iPair;struct Graph { int V, E;//V:the number of the vertices //E:the number of edges vector<pair<int, iPair>> e.