herrDeng網內搜尋
自訂搜尋
熱門文章
-
Py3 C++奇偶交錯奇偶子數列解Leecode 3201 Find the Maximum Length of Valid Subsequence I 求最長有效子序列，使得 (sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 ==...
-
教育部為提昇全民資安素養與電腦防護能力，本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動，請在活動期間內踴躍上網檢測資訊安全素養認知程度，並有機會參與抽獎，詳情請參閱活動網站（網址： https://isafe.moe.edu.tw/event
-
二元搜尋sliding window cpp py3解Leetcode 2106難題Maximum Fruits Harvested After at Most K Steps [C++ solution請進]
-
C++ DP速解難題leetcode 3363 Find the Maximum Number of Fruits Collected [Python解請進]
-
C++ Py3 hashmap與binary search解Leetcode 1865 Finding Pairs With a Certain Sum 基本上用 hashmap。解釋為什麼要使用排序和二元搜尋找來優化程式碼 ----- Basically use hashmap...
-
你會用C的算子sizeof?
2 則留言:
friend Matrix operator^(Matrix& A, Matrix& B)
{
Matrix C(A.row, A.col);
for (int i = 0; i < A.row; i++) {
for (int j = 0; j < A.col; j++)
C(i, j) = (T)((T)A(i, j) ^ (T)B(i, j));
}
return C;
}
friend Matrix& operator*(Matrix A, Matrix B)
{
for (int i = 0;i < A.row;i++) {
for (int j = 0;j < B.col;j++) {
C(i, j) = 0;
for (int k = 0;k <A.col;k++)
C(i, j) += A(i, k)*B(k, j);
}
}
return C;
}
friend Matrix operator^(Matrix& A, Matrix& B)
{
Matrix C(A.row, A.col);
for (int i = 0; i < A.row; i++) {
for (int j = 0; j < A.col; j++)
C(i, j) = (T)((T)A(i, j) ^ (T)B(i, j));
}
return C;
}
friend Matrix& operator*(Matrix A, Matrix B)
{
for (int i = 0;i < A.row;i++) {
for (int j = 0;j < B.col;j++) {
C(i, j) = 0;
for (int k = 0;k <A.col;k++)
C(i, j) += A(i, k)*B(k, j);
}
}
return C;
}
張貼留言