Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Linear Seach
//created by Yeronazavr import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) {int count=0; int arr[]={10, 20, 80, 30, 60, 50, 110, 100, 110, 170}; for(int i=0;i<10;i++){ if(arr[i]==110 ){ count=count+arr[i]; System.out.println(i); } } if(count==0){System.out.println("Element x is not present in arr[]");} } }
run
|
edit
|
history
|
help
0
1
Escaping Literals (Table of records)
Quadratic_Equation.java
Java # Dizi ile ek bulma
Coding Challenge - 03 (Prime numbers)
Binary Tree Max path Sum
several at a time
4.C
Menu Combination Sum
1(E)