xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-11-03 19:52:01 +08:00
Code Issues Packages Projects Releases Wiki Activity

Retranslate the complete Japanese online edition from Chinese (#2008)

Browse Source 
* Retranslate the complete Japanese online edition from Chinese

* Fit Japanese homepage labels and localize heading permalinks

* Point Japanese contribution instructions to the Japanese preview

* Replace locale conditionals with multilingual UI tables
This commit is contained in:
Yudong Jin
2026-10-30 02:12:26 +08:00
committed by GitHub
parent 455e8c1281
commit 7257641e0e
1987 changed files with 23531 additions and 23261 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ja/codes/cpp/chapter_searching/two_sum.cpp
+8 -8
View File
@@ -9,7 +9,7 @@
/* 方法 1：総当たり列挙 */
vector<int> twoSumBruteForce(vector<int> &nums, int target) {
int size = nums.size();
// 2重ループのため、時間計算量は O(n^2)
// 二重ループのため、時間計算量は O(n^2)
for (int i = 0; i < size - 1; i++) {
for (int j = i + 1; j < size; j++) {
if (nums[i] + nums[j] == target)
@@ -22,9 +22,9 @@ vector<int> twoSumBruteForce(vector<int> &nums, int target) {
/* 方法 2：補助ハッシュテーブル */
vector<int> twoSumHashTable(vector<int> &nums, int target) {
int size = nums.size();
// 補助ハッシュテーブルを使用し、空間計算量は O(n)
// 補助ハッシュテーブルの空間計算量は O(n)
unordered_map<int, int> dic;
// 単一ループで、時間計算量は O(n)
// 一重ループのため、時間計算量は O(n)
for (int i = 0; i < size; i++) {
if (dic.find(target - nums[i]) != dic.end()) {
return {dic[target - nums[i]], i};
@@ -34,20 +34,20 @@ vector<int> twoSumHashTable(vector<int> &nums, int target) {
return {};
}
/* Driver Code */
/* 実行用コード */
int main() {
// ======= Test Case =======
// ======= テストケース =======
vector<int> nums = {2, 7, 11, 15};
int target = 13;
// ====== Driver Code ======
// ====== 実行用コード ======
// 方法 1
vector<int> res = twoSumBruteForce(nums, target);
cout << "方法1 res = ";
cout << "方法 1 res = ";
printVector(res);
// 方法 2
res = twoSumHashTable(nums, target);
cout << "方法2 res = ";
cout << "方法 2 res = ";
printVector(res);
return 0;