In Java, Find Unique Words With Tree Set
Download
Posts
In Java, Find Distinct Numbers From Array Of Integers Given By User
import java.util.Scanner; public class DistinctNumbers{ public static void main(String[]args){ int num, cnt = 0, i, j = 0; int[]nums=new int[10]; Scanner in = new Scanner(System.in); System.out.print("Enter ten numbers: "); while(cnt < nums.length && in.hasNextInt()){ num = in.nextInt(); cnt ++; i = j; while(0 < i-- && nums[i] != num); if(-1 == i) nums[j++] = num; } if(0 == j){ System.out.println("Error: No inputs given!"); return; } System.out.println("The number of distinct numbers is "+j); System.out.print("The distinct numbers are:"); i = 0; while(i < j) System.out.print(" "+nums[i++]); } }
In C++, Remove Duplicates From List
#include<iostream> #include<list> using namespace std; void printList(list<int> ints){ list<int>::iterator cur = ints.begin(), end = ints.end(); cout << "list: {"; while(cur != end){ cout << *cur; cur ++; if(cur != end) cout << ", "; } cout << "}" << endl; } int main(){ list<int> intList = {3, 23, 23, 43, 56, 11, 11, 23, 25}; printList(intList); intList.unique(); printList(intList); return 0; }