leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

commit 94fcdb79c54feb89603ce90c85cdb53f635aa446
parent b83f75100763fb0a6447f04913094aac0dd8a4b7
Author: Jack Sangdahl <jack@pngu.org>
Date:   Sat, 23 May 2026 09:12:01 +0300

1752. check if array is sorted and rotated

Diffstat:
Mcheck_array_sorted_rotated.c | 12+++++++++---
1 file changed, 9 insertions(+), 3 deletions(-)

diff --git a/check_array_sorted_rotated.c b/check_array_sorted_rotated.c @@ -18,7 +18,13 @@ bool check(int *nums, int numsSize) { int main() { int n1[] = {3, 4, 5, 1, 2}, n2[] = {2, 1, 3, 4}, n3[] = {1, 2, 3}; - printf("%d\n", check(n1, ARRAY_SIZE(n1))); // expect: 1 - printf("%d\n", check(n2, ARRAY_SIZE(n2))); // expect: 0 - printf("%d\n", check(n3, ARRAY_SIZE(n3))); // expect: 1 + int r1 = check(n1, ARRAY_SIZE(n1)); + int r2 = check(n2, ARRAY_SIZE(n2)); + int r3 = check(n3, ARRAY_SIZE(n3)); + printf("%d\n", r1); + assert(r1 == 1); + printf("%d\n", r2); + assert(r2 == 0); + printf("%d\n", r3); + assert(r3 == 1); }