cpp/Q38.cpp at main · Priyasha-Yadav/cpp · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

// 37. Given a sorted array and a target value, return the starting and ending position of that target in the array.Example:Input: [5, 7, 7, 8, 8, 10], target=8 ,Output: [3, 4]

#include <iostream>
using namespace std;

void searchRange(int arr[], int size, int target) {
    int start = -1, end = -1;

    for (int i = 0; i < size; i++) {
        if (arr[i] == target) {
            if (start == -1) {
                start = i;
            }
            end = i;
        }
    }

    if (start == -1) {
        cout << "[-1, -1]" << endl;
    } else {
        cout << "[" << start << ", " << end << "]" << endl;
    }
}

int main() {
    int arr[] = {5, 7, 7, 8, 8, 10};
    int size = sizeof(arr) / sizeof(arr[0]);
    int target = 8;

    searchRange(arr, size, target);
    return 0;
}

//
#include <iostream>
using namespace std;

int findFirst(int arr[], int size, int target) {
    for (int i = 0; i < size; i++) {
        if (arr[i] == target)
            return i;
    }
    return -1;
}

int findLast(int arr[], int size, int target) {
    for (int i = size - 1; i >= 0; i--) {
        if (arr[i] == target)
            return i;
    }
    return -1;
}

void searchRange(int arr[], int size, int target) {
    int first = findFirst(arr, size, target);
    if (first == -1) {
        cout << "[-1, -1]" << endl;
        return;
    }
    int last = findLast(arr, size, target);
    cout << "[" << first << ", " << last << "]" << endl;
}

int main() {
    int arr[] = {5, 7, 7, 8, 8, 10};
    int size = sizeof(arr) / sizeof(arr[0]);
    int target = 8;

    searchRange(arr, size, target);
    return 0;
}

//
#include <iostream>
using namespace std;

int findLeft(int arr[], int size, int target) {
    int left = 0, right = size - 1, result = -1;

    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] == target) {
            result = mid;
            right = mid - 1;
        } else if (arr[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return result;
}

int findRight(int arr[], int size, int target) {
    int left = 0, right = size - 1, result = -1;

    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (arr[mid] == target) {
            result = mid;
            left = mid + 1;
        } else if (arr[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }

    return result;
}

void searchRange(int arr[], int size, int target) {
    int first = findLeft(arr, size, target);
    if (first == -1) {
        cout << "[-1, -1]" << endl;
        return;
    }
    int last = findRight(arr, size, target);
    cout << "[" << first << ", " << last << "]" << endl;
}

int main() {
    int arr[] = {5, 7, 7, 8, 8, 10};
    int size = sizeof(arr) / sizeof(arr[0]);
    int target = 8;

    searchRange(arr, size, target);
    return 0;
}