我刚开始发布网站，对它了解不多。我似乎已经上传了托管应用程序的客户端部分（fornex）。但是我在C#中也有一个应用程序的服务器部分，它负责站点的逻辑。我需要做什么才能与他们成为朋友？VPS出租？
有这样的标志
还有她的代码
<table id={'tableH'} className="history__body">
{
this.props.room?.discussions.map((d) => d.end != null && (
// eslint-disable-next-line react/jsx-key
<div className={'history__story__body'}>
<Story discussionId={d.id} onClick={this.handleClickOpen} key={d.id} title={d.title} average={d.averageVote} />
<Button onClick={undefined} className={'history__story-btnDelete'} title={<img src={remove} />} />
</div>
))
}
</table>
const Story: React.FC<IProps> = (props) => {
return <div onClick={() => props.onClick(props.discussionId)}>
<tr className="history__story">
<td>{props.title}</td>
<td className="history__story-value">{props.average}</td>
</tr>
</div>
;
}
这样的故事，连同它右边的按钮，被添加到这个表中。那么如何在单击按钮时删除整个特定行？
有这个代码：
CREATE TABLE PODPISANT (
"Number" NUMBER NOT NULL,
scop_of_authority CHAR(1 char),
status CHAR(1 char),
...
);
create trigger basis_of_authority_tg before insert on PODPISANT
begin
if PODPISANT.status = '3' and basis_of_authority_of_org is null then
raise_application_error(-20001,'basis_of_authority_of_org для Статус=3. '||
'Указываются основания полномочий (доверия) организации');
end if;
end;
并在编译触发器后出现此错误：
PLS-00357：在此上下文中不允许表、视图或序列引用“PODPISANT.STATUS”
触发器有什么问题？
如何进行约束，REGEXPLIKE()以便只能插入格式中的一行'ЧЧ.ММ.СС'？
只有 8 个字符，分数也被考虑在内。
如何去除矩阵？我收到此错误
#include <iostream>
#include <algorithm>
#include <windows.h>
#include <omp.h>
using namespace std;
class Graph {
private:
bool** adjMatrix;
bool** Pmatrix;
int numVertices;
int* p; // перестановка
public:
Graph(int numVertices) {
this->numVertices = numVertices;
adjMatrix = new bool* [numVertices];
Pmatrix = new bool* [numVertices];
for (int i = 0; i < numVertices; i++) {
adjMatrix[i] = new bool[numVertices];
Pmatrix[i] = new bool[numVertices];
for (int j = 0; j < numVertices; j++) {
adjMatrix[i][j] = false;
Pmatrix[i][j] = false;
}
}
p = new int[numVertices];
for (int i = 0; i < numVertices; i++)
p[i] = i;
}
int getNumVertices() {
return numVertices;
}
void addEdge(int i, int j) {
adjMatrix[i][j] = true;
adjMatrix[j][i] = true;
}
int* getP() {
return p;
}
bool** getAdjMatrix() {
return adjMatrix;
}
int* retPer() {
next_permutation(p, p + numVertices);
cout << "Перестановка" << endl;
for (int i = 0; i < numVertices; i++)
cout << p[i] << " ";
cout << endl;
return p;
}
bool** retPmatrix(int* p) {
for (int i = 0; i < numVertices; i++)
for (int j = 0; j < numVertices; j++)
Pmatrix[i][j] = false;
for (int i = 0; i < numVertices; i++)
Pmatrix[p[i]][i] = true;
return Pmatrix;
}
bool** traspPmatrix(bool** Pmatrix) {
bool** tPmatrix = new bool* [numVertices];
for (int i = 0; i < numVertices; i++) {
tPmatrix[i] = new bool[numVertices];
for (int j = 0; j < numVertices; j++)
tPmatrix[i][j] = Pmatrix[j][i];
}
return tPmatrix;
}
bool** mulMatrix(bool** A, bool** B) {
bool** C = new bool* [numVertices];
int i, j, k;
for (i = 0; i < numVertices; i++) {
C[i] = new bool[numVertices];
for (j = 0; j < numVertices; j++)
C[i][j] = false;
}
for (i = 0; i < numVertices; i++) {
for (j = 0; j < numVertices; j++)
for (k = 0; k < numVertices; k++)
C[i][j] = C[i][j] || (A[i][k] && B[k][j]);
}
return C;
}
void printMatrix(bool** Matrix) {
for (int i = 0; i < numVertices; i++) {
cout << i << " : ";
for (int j = 0; j < numVertices; j++)
cout << Matrix[i][j] << " ";
cout << endl;
}
cout << endl;
}
Graph(const Graph &graph) : adjMatrix(graph.adjMatrix), Pmatrix(graph.Pmatrix),
numVertices(graph.numVertices), p(graph.p) {}
~Graph() {
for (int i = 0; i < numVertices; ++i) {
delete[] adjMatrix[i];
delete[] Pmatrix[i];
}
delete[] adjMatrix;
delete[] Pmatrix;
delete p;
}
};
bool isIsomorph(Graph g1, Graph g2) {
int* Per = g1.getP();
bool** Iso = g1.mulMatrix(g1.mulMatrix(g1.retPmatrix(Per), g1.getAdjMatrix()), g1.traspPmatrix(g1.retPmatrix(Per)));
if (g2.getAdjMatrix() == Iso)
return 1;
else
return 0;
}
int main() {
SetConsoleCP(1251);
SetConsoleOutputCP(1251);
double start_time, end_time;
Graph g1(4), g2(4);
//GRAPH1////////
g1.addEdge(0, 1);
g1.addEdge(0, 2);
g1.addEdge(1, 2);
g1.addEdge(2, 3);
//GRAPH2/////////
g2.addEdge(0, 1);
g2.addEdge(0, 2);
g2.addEdge(1, 2);
g2.addEdge(2, 3);
if (g1.getNumVertices() == g2.getNumVertices()) {
if (g1.getAdjMatrix() != g2.getAdjMatrix()) {
cout << "Матрица смежности графа А" << endl;
g1.printMatrix(g1.getAdjMatrix());
cout << "Матрица смежности графа B" << endl;
g2.printMatrix(g2.getAdjMatrix());
cout << "Первоначальная перестановка = [0, 1, 2, 3]" << endl; //ее не видно
start_time = omp_get_wtime();
if (isIsomorph(g1, g2))
cout << "Графы изоморфны" << endl;
else
cout << "Графы НЕ изоморфны" << endl;
end_time = omp_get_wtime();
printf("Время на замер времени %lf\n", end_time - start_time);
}
else
cout << "Вы ввели идентичные графы с одинаковыми матрицами смежностями, проверка на изоморфизм не требуется" << endl;
}
else
cout << "Error: Количество вершин не совпадает, проверка на изоморфизм отклоняется" << endl;
}
请将下面的 Kotlin 代码翻译成 Java。真的需要
class SimpleService : Service() {
private val binder = SimpleBinder()
//...//
override fun onBind(intent: Intent?): IBinder? {
return binder
}
inner class SimpleBinder : Binder() {
fun getService(): SimpleService = this@SimpleService
}
}
override fun onServiceConnected(name: ComponentName?, service: IBinder?) {
val binder = service as SimpleService.SimpleBinder
simpleService = binder.getService()
bound = true
}
}