GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Lonely-Integer/LonelyInteger.java at master · Java-Example/Lonely-Integer

Expand file tree

/

LonelyInteger.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
45 lines (40 loc) · 830 Bytes
/

LonelyInteger.java

Copy path

File metadata and controls

45 lines (40 loc) · 830 Bytes
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
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.util.ArrayList;
public class LonelyInteger{
public static void main(String[] args) {
Scanner s=new Scanner(System.in);
int no_of_testcase=s.nextInt();
ArrayList<Integer> number = new ArrayList<Integer>();
String str="";
int val,n;
for(int i=0;i<no_of_testcase;i++)
{
val=s.nextInt();
number.add(val);
}
for(int j=0;j<number.size();j++)
{
n=0;
for(int k=j+1;k<number.size();k++)
{
if(number.get(j)==number.get(k))
{
number.remove(k);
k--;
n=1;
}
}
if(n==1){
number.remove(j);
j--;
}
}
for(int l=0;l<number.size();l++)
str+=number.get(l)+" ";
System.out.print(str);
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.