Re-translate the Japanese version (#1871)

* Retranslate Japanese docs with GPT-5.4

* Retranslate Japanese code with GPT-5.4
This commit is contained in:
Yudong Jin
2026-03-30 07:30:15 +08:00
committed by GitHub
parent fe6443235b
commit d7b2277d2b
1444 changed files with 83312 additions and 8363 deletions

View File

@@ -6,41 +6,41 @@
#include "../utils/common.hpp"
/* ドライバーコード */
/* Driver Code */
int main() {
/* 両端キューを初期化 */
deque<int> deque;
/* 要素エンキュー */
/* 要素エンキュー */
deque.push_back(2);
deque.push_back(5);
deque.push_back(4);
deque.push_front(3);
deque.push_front(1);
cout << "Double-ended queue deque = ";
cout << "両端キュー deque = ";
printDeque(deque);
/* 要素にアクセス */
int front = deque.front();
cout << "Front element of the queue front = " << front << endl;
cout << "先頭要素 front = " << front << endl;
int back = deque.back();
cout << "Back element of the queue back = " << back << endl;
cout << "末尾要素 back = " << back << endl;
/* 要素デキュー */
/* 要素デキュー */
deque.pop_front();
cout << "Front element dequeued = " << front << ", after dequeuing from the front";
cout << "先頭から取り出した要素 popFront = " << front << "、先頭から取り出した後の deque = ";
printDeque(deque);
deque.pop_back();
cout << "Back element dequeued = " << back << ", after dequeuing from the back";
cout << "末尾から取り出した要素 popLast = " << back << "、末尾から取り出した後の deque = ";
printDeque(deque);
/* 両端キューの長さを取得 */
int size = deque.size();
cout << "Length of the double-ended queue size = " << size << endl;
cout << "両端キューの長さ size = " << size << endl;
/* 両端キューが空かどうかを判定 */
bool empty = deque.empty();
cout << "Is the double-ended queue empty = " << empty << endl;
cout << "両端キューが空かどうか = " << empty << endl;
return 0;
}
}