FilesExpand file tree

 master

/

find_num.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

114 lines (103 loc) · 2.8 KB

 master

/

find_num.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

114 lines (103 loc) · 2.8 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

/*

* Copyright(c) 2019 Jiau Zhang

* For more information see <https://github.com/JiauZhang/algorithms>

*

* This repo is free software: you can redistribute it and/or modify

* it under the terms of the GNU General Public License as published by

* the Free Software Foundation

*

* It is distributed in the hope that it will be useful,

* but WITHOUT ANY WARRANTY; without even the implied warranty of

* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

* GNU General Public License for more details.

*

* You should have received a copy of the GNU General Public License

* along with THIS repo. If not, see <http://www.gnu.org/licenses/>.

*/

#include <iostream>

using namespace std;

bool find_num(int* matrix, int rows, int cols, int find)

{

int steps = 0;

if(matrix && cols>0 && rows>0) {

for(int i=0; i<rows; i++) {

for(int j=0; j<cols; j++) {

steps++;

if(matrix[cols*i+j] == find) {

cout << "steps: " << steps << endl;

return true;

}

}

}

}

cout << "steps: " << steps << endl;

return false;

}

bool find_num_top_right(int* matrix, int rows, int cols, int find)

{

int steps = 0;

if(matrix && cols>0 && rows>0) {

int col = cols - 1;

int row = 0;

while(col>=0 && row<rows) {

steps++;

if(matrix[row*cols+col]>find)

col--;

else if(matrix[row*cols+col]<find)

row++;

else {

cout << "steps: " << steps << endl;

return true;

}

}

}

cout << "steps: " << steps << endl;

return false;

}

bool find_num_bottom_left(int* matrix, int rows, int cols, int find)

{

int steps = 0;

if(matrix && cols>0 && rows>0) {

int col = 0;

int row = rows - 1;

while(col<cols && row>=0) {

steps++;

if(matrix[row*cols+col]>find)

row--;

else if(matrix[row*cols+col]<find)

col++;

else {

cout << "steps: " << steps << endl;

return true;

}

}

}

cout << "steps: " << steps << endl;

return false;

}

void Test(int* matrix, int rows, int cols, int num)

{

bool result = find_num(matrix, rows, cols, num);

cout << (result?"true":"false") << endl;

result = find_num_top_right(matrix, rows, cols, num);

cout << (result?"true":"false") << endl;

result = find_num_bottom_left(matrix, rows, cols, num);

cout << (result?"true":"false") << endl;

}

int main(int argc, char** argv)

{

int array_test[5][5] = {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};

Test(&array_test[0][0], 5, 5, 1);

Test(&array_test[0][0], 5, 5, 5);

Test(&array_test[0][0], 5, 5, 11);

Test(&array_test[0][0], 5, 5, 13);

Test(&array_test[0][0], 5, 5, 15);

Test(&array_test[0][0], 5, 5, 21);

Test(&array_test[0][0], 5, 5, 25);

Test(&array_test[0][0], 5, 5, 0);

return 0;

}