Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
33 lines (28 loc) · 1.15 KB

File metadata and controls

33 lines (28 loc) · 1.15 KB
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
public class Program64 {
//find the 1st and last occurrence of an element in string using recursion
public static int first = -1, last = -1;
public static void findOccurence(String str, int indx, char element) {
if (indx == str.length()) {
// Base case: if we have reached the end of the string
System.out.println("the first occurance of element is at index : " + first);
System.out.println("the last occurance of element is at index : " + last);
}
// Recursive case: check the current character
char currChar = str.charAt(indx);
if (currChar == element) {
if (first == -1) {
first = indx; // first occurrence
} else {
last = indx; // last occurrence}
}
}
// Continue to the next character
findOccurence(str, indx + 1, element);
}
public static void main(String[] args) {
String str = "abaacdaefaah";
System.out.println("string:" + str);
// Find the first and last occurrence of 'a'
findOccurence(str, 0, 'a');
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.