qq_40795475的博客

2.4 新建任务->选择构建一个自由风格的软件项目，在源码管理处配置外部gitee的仓库地址，用户名和密码，选择maven版本，并指定要传输的jar、Dockerfile等文件地址，配置ssh server和构建完之后要执行的脚本。2.3 点击系统管理菜单，给jekins安装以下插件、maven-integration-plugin、publish_over_ssh、gitee；2.1 拉取镜像，挂载工作目录,xxxx为宿主机指定工作目录。2.5 最后点击立即构建即可实现ci/cd。

/usr/share/fonts/chinese

1.官网下载docker-compose文件，要用uname -r 看一下自己安装哪个版本。2.上传到/usr/local/bin目录下。

【代码】数组分割，方便多线程任务处理。

```javaimport java.util.Scanner;public class Main { public static String change(String s){ //结果字符串 StringBuilder sb=new StringBuilder(); //小写就直接append //遇到大写就继续往后判断一直到最后一个连续的大写为止 然后插入_小写_ //只有一个大写直接 append .

#include <iostream>using namespace std;typedef struct BinarySearchTree{ int data; int count; struct BinarySearchTree* left; struct BinarySearchTree* right; BinarySearchTree() { } BinarySearchTree(int x)

#include <iostream>using namespace std;int main() { int a[10]; int n; cin>>n; for(int i=0;i<n;++i) { cin>>a[i]; } for(int i=0;i<n;++i) { cout<<a[i]; } ...

#include <iostream>using namespace std;typedef struct Tnode{ int data; struct Tnode* left; struct Tnode* right; Tnode(int x) { this->data=x; this->left=NULL; this->right=NULL; } Tnode()

```cpp```cpp#include <iostream>using namespace std;typedef struct Node{ int data; struct Node* next; Node(int x) { this->data=x; this->next=NULL; } //空的构造方法 Node(){ }};//打印链表void print(.

#include <stdio.h>#include <stdlib.h>//链表结构typedef struct Lnode{ int data; struct Lnode* next;}Lnode;//打印链表void printList(Lnode* head){ Lnode* p=head->next; while(p) { printf("%d ",p->data); p=

#include <iostream>#define MAXSIZE 100using namespace std;typedef struct Tnode{ int data; bool isExist;}Tnode;typedef struct SequenceTree{ struct Tnode tree[MAXSIZE]; int length;}SequenceTree;int getCommonAncestor(int i,int j,

#include <iostream>using namespace std;struct node{ int num; int cnt;};int main(){ int n; cin>>n; int a[10]; struct node nums[11]; int k=-1; for(int i=0; i<n; ++i) { int data; bool .

#include <iostream>#include <vector>#include <set>#define maxn 10001using namespace std;int m,n;bool visited[maxn]= {false};int color[maxn];vector<int>v[maxn];int f=0...

#include <iostream>#include <cstring>using namespace std;const int maxn=101;int dp[maxn];int sum(int n){ if(n<=0) return 0 ; if(n==1) return 1; else...

#include <iostream>#include <vector>#include <cstdio>#include <cstring>#define INF 0x3f3f3f#define maxn 10001using namespace std;int graph[maxn][maxn];int n,m;void in...

#include <iostream>#include <vector>#include <algorithm>#define maxn 1001using namespace std;vector<int>v[maxn];vector<int>result;bool visited[maxn]= {false};int...

#include <iostream>#include <queue>#include <vector>using namespace std;queue<int>a;queue<int>b;int main(){ int n; cin>>n; for(int i=0;i<n...