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
16 lines (16 loc) · 427 Bytes

File metadata and controls

16 lines (16 loc) · 427 Bytes
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
//in a given integer array, this program finds the missing numberin array
public class MissingNumInArray {
public static void main(String[] args) {
int arr[]={1,5,4,3,2,6,7,10,8};
System.out.println(MissNum(arr));
}
public static int MissNum(int arr[]){
int n=arr.length;
int total=((n+1)*(n+2))/2;
int currSum=0;
for(int i=0;i<n;i++) {
currSum+=arr[i];
}
return total-currSum;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.