From 5cc58c7b916cc97a61ddd4a8d6ca4d060474f0e1 Mon Sep 17 00:00:00 2001 From: Gonglja Date: Thu, 12 Jan 2023 07:08:56 +0800 Subject: [PATCH] =?UTF-8?q?fix(docs/cpp):=20fix=20=20error:=20comparison?= =?UTF-8?q?=20of=20integer=20expressions=20of=20different=20signedness:=20?= =?UTF-8?q?=E2=80=98size=5Ft=E2=80=99=20{aka=20=E2=80=98long=20unsigned=20?= =?UTF-8?q?int=E2=80=99}=20and=20=E2=80=98int=E2=80=99=20[-Werror=3Dsign-c?= =?UTF-8?q?ompare]?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- codes/cpp/chapter_array_and_linkedlist/list.cpp | 4 ++-- .../worst_best_time_complexity.cpp | 2 +- codes/cpp/chapter_searching/hashing_search.cpp | 2 +- codes/cpp/chapter_searching/linear_search.cpp | 2 +- codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp | 2 +- 5 files changed, 6 insertions(+), 6 deletions(-) diff --git a/codes/cpp/chapter_array_and_linkedlist/list.cpp b/codes/cpp/chapter_array_and_linkedlist/list.cpp index 44bbf88c8..aadf83d40 100644 --- a/codes/cpp/chapter_array_and_linkedlist/list.cpp +++ b/codes/cpp/chapter_array_and_linkedlist/list.cpp @@ -48,8 +48,8 @@ int main() { PrintUtil::printVector(list); /* 通过索引遍历列表 */ - int count = 0; - for (int i = 0; i < list.size(); i++) { + size_t count = 0; + for (size_t i = 0; i < list.size(); i++) { count++; } diff --git a/codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp b/codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp index c2916cb40..c3f35adaf 100644 --- a/codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp +++ b/codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp @@ -22,7 +22,7 @@ vector randomNumbers(int n) { /* 查找数组 nums 中数字 1 所在索引 */ int findOne(vector& nums) { - for (int i = 0; i < nums.size(); i++) { + for (size_t i = 0; i < nums.size(); i++) { if (nums[i] == 1) return i; } diff --git a/codes/cpp/chapter_searching/hashing_search.cpp b/codes/cpp/chapter_searching/hashing_search.cpp index ebc2fb01c..57c9f5d16 100644 --- a/codes/cpp/chapter_searching/hashing_search.cpp +++ b/codes/cpp/chapter_searching/hashing_search.cpp @@ -33,7 +33,7 @@ int main() { vector nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 }; // 初始化哈希表 unordered_map map; - for (int i = 0; i < nums.size(); i++) { + for (size_t i = 0; i < nums.size(); i++) { map[nums[i]] = i; // key: 元素，value: 索引 } int index = hashingSearch(map, target); diff --git a/codes/cpp/chapter_searching/linear_search.cpp b/codes/cpp/chapter_searching/linear_search.cpp index 7b5092762..45a08ded7 100644 --- a/codes/cpp/chapter_searching/linear_search.cpp +++ b/codes/cpp/chapter_searching/linear_search.cpp @@ -9,7 +9,7 @@ /* 线性查找（数组） */ int linearSearch(vector& nums, int target) { // 遍历数组 - for (int i = 0; i < nums.size(); i++) { + for (size_t i = 0; i < nums.size(); i++) { // 找到目标元素，返回其索引 if (nums[i] == target) return i; diff --git a/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp b/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp index ae22740d6..5694e702e 100644 --- a/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp +++ b/codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp @@ -68,7 +68,7 @@ public: vector toVector() { ListNode* node = front; vector res(size()); - for (int i = 0; i < res.size(); i++) { + for (size_t i = 0; i < res.size(); i++) { res[i] = node->val; node = node->next; }