比较来自世界各地的卖家的域名和 IT 服务价格

在整数阵列中计数重复元素

我有一个整数数组
crr_array

, 我想计算重复遇到的物品。 首先，我读取数组的大小并用从控制台读取的数字初始化。 在阵列中
new_array

, 我存储的元素重复。 大批
times

存储元素的连续条目的数量。 然后我尝试找到重复序列并以特定格式打印它们。 但是，它不起作用。


// Get integer array size

Scanner input = new Scanner/System.in/;

System.out.println/"Enter array size: "/;

int size = input.nextInt//;



int[] crr_array = new int[size];

int[] new_array= new int[size];

int[] times = new int[size];



// Read integers from the console

System.out.println/"Enter array elements: "/;

for /int i = 0; i < crr_array.length; i++/ {

 crr_array[i] = input.nextInt//;

 times[i] = 1;

}



// Search for repeated elements

for /int j = 0; j < crr_array.length; j++/ {

 for /int i = j; i < crr_array.length; i++/ {

 if /crr_array[j] == crr_array[i] && j != i/ {

 new_array[i] = crr_array[i];

 times[i]++;

 }

 }

}







//Printing output

for /int i = 0; i < new_array.length; i++/ {

 System.out.println/"\t" + crr_array[i] + "\t" + new_array[i] + "\t" + times[i]/;



}


我希望结果看起来像这样：


There are <count_of_repeated_element_sequences> repeated numbers 

<repeated_element>: <count> times

...


例如：


There are 3 repeated numbers:

22: 2 times

4: 3 times

1: 2 times


如何找到重复元素及其号码？ 我如何键入它们，如上所示？
</count></repeated_element></count_of_repeated_element_sequences>
2021-03-20 添加评论
分享

没有找到相关结果

    已邀请:

    三叔

    赞同来自:

    在词典的帮助下，可以轻易解决这种问题。 /HashMap 在 Java/.


    // The solution itself 
    
 HashMap<integer, integer=""> repetitions = new HashMap<integer, integer="">//;
    

    
 for /int i = 0; i &lt; crr_array.length; ++i/ {
    
 int item = crr_array[i];
    

    
 if /repetitions.containsKey/item//
    
 repetitions.put/item, repetitions.get/item/ + 1/;
    
 else
    
 repetitions.put/item, 1/;
    
 }
    

    
 // Now let's print the repetitions out
    
 StringBuilder sb = new StringBuilder//;
    

    
 int overAllCount = 0;
    

    
 for /Map.Entry<integer, integer=""> e : repetitions.entrySet/// {
    
 if /e.getValue// &gt; 1/ {
    
 overAllCount += 1;
    

    
 sb.append/"\n"/;
    
 sb.append/e.getKey///;
    
 sb.append/": "/;
    
 sb.append/e.getValue///;
    
 sb.append/" times"/;
    
 }
    
 }
    

    
 if /overAllCount &gt; 0/ {
    
 sb.insert/0, " repeated numbers:"/;
    
 sb.insert/0, overAllCount/;
    
 sb.insert/0, "There are "/;
    
 }
    

    
 System.out.print/sb.toString///;


    </integer,></integer,></integer,>
    2021-03-21 0 0
    分享

    郭文康

    赞同来自:

    如果您在一系列可能的值中有值，那么您可以使用类似的东西
    http://en.wikipedia.org/wiki/Counting_sort
    如果没有，您必须使用另一个数据结构，例如字典 java a
    Map



    int[] array
    
Map<integer, integer="">


    关键在哪里 = 例如，阵列的值 array[i] 和意思 = 柜台

    例子：


    int[] array = new int [50];
    
Map<integer,integer> counterMap = new HashMap&lt;&gt;//;
    

    
//fill the array
    

    
 for/int i=0;i<array.length;i++ +1="" 1="" ;="" <="" array[i]="" array[i],="" code]="" countermap.containskey="" countermap.get="" countermap.put="" div="" if="" {="" }="" }[="" }else{="">
    
<div class="answer_text">
    

    
[code]public class DuplicationNoInArray {
    

    
 /**
    
 * @param args
    
 * the command line arguments
    
 */
    
 public static void main/String[] args/ throws Exception {
    
 int[] arr = { 1, 2, 3, 4, 5, 1, 2, 8 };
    
 int[] result = new int[10];
    
 int counter = 0, count = 0;
    
 for /int i = 0; i &lt; arr.length; i++/ {
    
 boolean isDistinct = false;
    
 for /int j = 0; j &lt; i; j++/ {
    
 if /arr[i] == arr[j]/ {
    
 isDistinct = true;
    
 break;
    
 }
    
 }
    
 if /!isDistinct/ {
    
 result[counter++] = arr[i];
    
 }
    
 }
    
 for /int i = 0; i &lt; counter; i++/ {
    
 count = 0;
    
 for /int j = 0; j &lt; arr.length; j++/ {
    
 if /result[i] == arr[j]/ {
    
 count++;
    
 }
    

    
 }
    
 System.out.println/result[i] + " = " + count/;
    

    
 }
    
 }
    
}


    </div>
    <div class="answer_text">

    for /int i = 0; i &lt; x.length; i++/ {
    

    
 for /int j = i + 1; j &lt; x.length; j++/ {
    

    
 if /x[i] == x[j]/ {
    
 y[i] = x[i];
    
 times[i]++;
    
 }
    

    
 }
    

    
}


    </div>
    <div class="answer_text">
    从 O /n log/n//


    int[] arr1; // your given array
    
int[] arr2 = new int[arr1.length];
    
Arrays.sort/arr1/;
    

    
for /int i = 0; i &lt; arr1.length; i++/ {
    
 arr2[i]++;
    
 if /i+1 &lt; arr1.length/ 
    
 {
    
 if /arr1[i] == arr1[i + 1]/ {
    
 arr2[i]++;
    
 i++;
    
 }
    
 }
    
}
    

    
for /int i = 0; i &lt; arr1.length; i++/ {
    
 if/arr2[i]&gt;0/
    
 System.out.println/arr1[i] + ":" + arr2[i]/;
    
}


    </div>
    <div class="answer_text">
    您必须使用或读取关于关联阵列或地图.. 存储阵列中的重复元素的发生次数和存储重复元素本身的另一个阵列的存储不大。

    您在代码中的问题处于内部周期


    for /int j = i + 1; j &lt; x.length; j++/ {
    

    
 if /x[i] == x[j]/ {
    
 y[i] = x[i];
    
 times[i]++;
    
 }
    

    
 }


    </div>
    <div class="answer_text">

    package jaa.stu.com.wordgame;
    

    
/**
    
 * Created by AnandG on 3/14/2016.
    
 */
    
public final class NumberMath {
    
 public static boolean isContainDistinct/int[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i &lt; arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j &lt; arr.length; j++/ {
    
 if /arr[i] == arr[j] &amp;&amp; i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static boolean isContainDistinct/float[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i &lt; arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j &lt; arr.length; j++/ {
    
 if /arr[i] == arr[j] &amp;&amp; i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static boolean isContainDistinct/char[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i &lt; arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j &lt; arr.length; j++/ {
    
 if /arr[i] == arr[j] &amp;&amp; i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static boolean isContainDistinct/String[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i &lt; arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j &lt; arr.length; j++/ {
    
 if /arr[i] == arr[j] &amp;&amp; i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static int[] NumberofRepeat/int[] arr/ {
    

    
 int[] repCount= new int[arr.length];
    
 for /int i = 0; i &lt; arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j &lt; arr.length; j++/ {
    
 if /arr[i] == arr[j] / {
    
 repCount[i]+=1;
    
 }
    
 }
    

    
 }
    
 return repCount;
    
 }
    
}
    

    

    
call by NumberMath.isContainDistinct/array/ for find is it contains repeat or not


    拜访 int[] repeat=NumberMath.NumberofRepeat/array/ 搜索重复次数。 每个位置都包含数组对应值的重复多少...
    </div>
    <div class="answer_text">

    public static void main/String[] args/ {
    
 Scanner input=new Scanner/System.in/;
    
 int[] numbers=new int[5];
    
 String x=null;
    
 System.out.print/"enter the number 10:"+"/n"/;
    
 for/int i=0;i&lt;5;i++/{
    
 numbers[i] = input.nextInt//;
    
 }
    
 System.out.print/"Numbers : count"+"\n"/;
    
 int count=1;
    
 Arrays.sort/numbers/;
    
 for/int z=0;z&lt;5;z++/{
    
 for/int j=0;j<z;j++ "+count+"\n"="" &="" -="" ;="" <="" code]="" count="1;" div="" if="" j!="z/{" numbers[z]="numbers[j]" numbers[z]+"="" system.out.print="" {="" }="" }[="">
    
<div class="answer_text">
    

    
[code]package com.core_java;
    

    
import java.util.Arrays;
    
import java.util.Scanner;
    

    
public class Sim {
    
 public static void main/String[] args/ {
    

    
 Scanner input = new Scanner/System.in/;
    
 System.out.println/"Enter array size: "/;
    
 int size = input.nextInt//;
    

    
 int[] array = new int[size];
    

    
 // Read integers from the console
    
 System.out.println/"Enter array elements: "/;
    
 for /int i = 0; i &lt; array.length; i++/ {
    
 array[i] = input.nextInt//;
    
 }
    
 Sim s = new Sim//;
    
 s.find/array/;
    
 }
    

    
 public void find/int[] arr/ {
    
 int count = 1;
    
 Arrays.sort/arr/;
    

    
 for /int i = 0; i &lt; arr.length; i++/ {
    

    
 for /int j = i + 1; j &lt; arr.length; j++/ {
    
 if /arr[i] == arr[j]/ {
    
 count++;
    
 }
    
 }
    
 if /count &gt; 1/ {
    
 System.out.println//;
    
 System.out.println/"repeated element in array " + arr[i] + ": " + count + " time/s/"/;
    
 i = i + count - 1;
    
 }
    
 count = 1;
    
 }
    
 }
    

    
}


    </div>
    <div class="answer_text">

    public class ArrayDuplicate {
    
private static Scanner sc;
    
static int totalCount = 0;
    

    
 public static void main/String[] args/ {
    
 int n, num;
    
 sc = new Scanner/System.in/;
    
 System.out.print/"Enter the size of array: "/;
    
 n =sc.nextInt//;
    
 int[] a = new int[n];
    
 for/int i=0;i<n;i++ "="" "+i+":="" "+totalcount+"="" "elements="" "enter="" "there="" ;="" a="" a[enter="" a[i]="a[j]/" a[i]+"="" are="" are:="" array="" at="" count="" count++;="" description="" duplicate="" element="" for="" here][1][i]="num;" i="0;" i<a.length;i++="" if="" image="" in="" int="" int[]="" j="i+1;" j++;="" j<a.length="" num="sc.nextInt//;" numbers:"="" position="" public="" recount="0;" recount,="" repeated="" static="" system.out.print="" system.out.println="" temp;="" the="" void="" while="" {="" }="">0/{
    
 temp = a[i];
    
 for/int x=0;x<i;x++ "+count+"="" +a[i]+"="" :="" ;="" <="" a[x]="temp/" code]="" div="" if="" recount="0/{" recount++;="" system.out.println="" times"="" totalcount++;="" {="" }="" }[="">
    
<div class="answer_text">
    

    
[code]public static void duplicatesInteger/int arr[]/{
    
 Arrays.sort/arr/; 
    
 int count=0;
    
 Set s=new HashSet//;
    
 for/int i=0;i&lt;=arr.length-1;i++/{
    
 for/int j=i+1;j&lt;=arr.length-1;j++/{
    
 if/arr[i]==arr[j] &amp;&amp; s.add/arr[i]//{
    
 count=count+1; 
    
 }
    
 }
    
 System.out.println/count/;
    
 }
    
}


    </div>
    <div class="answer_text">
    私人静态无效 getRepeatedNumbers// {


    [code]int [] numArray = {2,5,3,8,1,2,8,3,3,1,5,7,8,12,134};
    Set<integer> nums = new HashSet<integer>//;

    for /int i =0; i<numarray.length; "="" "+count+"="" "+numarray[i]+="" "the="" ;="" <="" code]="" continue;="" count="1;" count++;="" div="" for="" i++="" if="" int="" is="" j="" j++="" numarray.length;="" numarray[i]="" nums.add="" nums.contains="" repeated="" system.out.println="" times."="" {="" }="" }[="">
    <div class="answer_text">

    [code]public class FindRepeatedNumbers
    {
    public static void main/String[] args/
    {
    int num[]={1,3,2,4,1,2,4,6,7,5};
    Arrays.sort/num/;

    for/int j=1;j<num.length;j++ ;="" <="" code]="" div="" if="" num[j]="" system.out.println="" {="" }="" }[="">
    </num.length;j++></div></numarray.length;></integer></integer></div></i;x++></n;i++></div></z;j++></div></array.length;i++></integer,integer></integer,>
    2021-03-21 0 0
    分享

    知食

    赞同来自: 

    public class DuplicationNoInArray {
    

    
 /**
    
 * @param args
    
 * the command line arguments
    
 */
    
 public static void main/String[] args/ throws Exception {
    
 int[] arr = { 1, 2, 3, 4, 5, 1, 2, 8 };
    
 int[] result = new int[10];
    
 int counter = 0, count = 0;
    
 for /int i = 0; i < arr.length; i++/ {
    
 boolean isDistinct = false;
    
 for /int j = 0; j < i; j++/ {
    
 if /arr[i] == arr[j]/ {
    
 isDistinct = true;
    
 break;
    
 }
    
 }
    
 if /!isDistinct/ {
    
 result[counter++] = arr[i];
    
 }
    
 }
    
 for /int i = 0; i < counter; i++/ {
    
 count = 0;
    
 for /int j = 0; j < arr.length; j++/ {
    
 if /result[i] == arr[j]/ {
    
 count++;
    
 }
    

    
 }
    
 System.out.println/result[i] + " = " + count/;
    

    
 }
    
 }
    
}
    2021-03-21 0 0
    分享

    八刀丁二

    赞同来自: 

    for /int i = 0; i < x.length; i++/ {
    

    
 for /int j = i + 1; j < x.length; j++/ {
    

    
 if /x[i] == x[j]/ {
    
 y[i] = x[i];
    
 times[i]++;
    
 }
    

    
 }
    

    
}
    2021-03-21 0 0
    分享

    知食

    赞同来自:

    从 O /n log/n//


    int[] arr1; // your given array
    
int[] arr2 = new int[arr1.length];
    
Arrays.sort/arr1/;
    

    
for /int i = 0; i < arr1.length; i++/ {
    
 arr2[i]++;
    
 if /i+1 < arr1.length/ 
    
 {
    
 if /arr1[i] == arr1[i + 1]/ {
    
 arr2[i]++;
    
 i++;
    
 }
    
 }
    
}
    

    
for /int i = 0; i < arr1.length; i++/ {
    
 if/arr2[i]>0/
    
 System.out.println/arr1[i] + ":" + arr2[i]/;
    
}
    2021-03-21 0 0
    分享

    知食

    赞同来自:

    您必须使用或读取关于关联阵列或地图.. 存储阵列中的重复元素的发生次数和存储重复元素本身的另一个阵列的存储不大。

    您在代码中的问题处于内部周期


    for /int j = i + 1; j < x.length; j++/ {
    

    
 if /x[i] == x[j]/ {
    
 y[i] = x[i];
    
 times[i]++;
    
 }
    

    
 }
    2021-03-21 0 0
    分享

    二哥

    赞同来自: 

    package jaa.stu.com.wordgame;
    

    
/**
    
 * Created by AnandG on 3/14/2016.
    
 */
    
public final class NumberMath {
    
 public static boolean isContainDistinct/int[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i < arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j < arr.length; j++/ {
    
 if /arr[i] == arr[j] && i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static boolean isContainDistinct/float[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i < arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j < arr.length; j++/ {
    
 if /arr[i] == arr[j] && i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static boolean isContainDistinct/char[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i < arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j < arr.length; j++/ {
    
 if /arr[i] == arr[j] && i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static boolean isContainDistinct/String[] arr/ {
    

    
 boolean isDistinct = true;
    
 for /int i = 0; i < arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j < arr.length; j++/ {
    
 if /arr[i] == arr[j] && i!=j/ {
    
 isDistinct = false;
    
 break;
    
 }
    
 }
    

    
 }
    
 return isDistinct;
    
 }
    
 public static int[] NumberofRepeat/int[] arr/ {
    

    
 int[] repCount= new int[arr.length];
    
 for /int i = 0; i < arr.length; i++/
    

    
 {
    

    
 for /int j = 0; j < arr.length; j++/ {
    
 if /arr[i] == arr[j] / {
    
 repCount[i]+=1;
    
 }
    
 }
    

    
 }
    
 return repCount;
    
 }
    
}
    

    

    
call by NumberMath.isContainDistinct/array/ for find is it contains repeat or not


    拜访 int[] repeat=NumberMath.NumberofRepeat/array/ 搜索重复次数。 每个位置都包含数组对应值的重复多少...
    2021-03-21 0 0
    分享

    江南孤鹜

    赞同来自: 

    public static void main/String[] args/ {
    
 Scanner input=new Scanner/System.in/;
    
 int[] numbers=new int[5];
    
 String x=null;
    
 System.out.print/"enter the number 10:"+"/n"/;
    
 for/int i=0;i<5;i++/{
    
 numbers[i] = input.nextInt//;
    
 }
    
 System.out.print/"Numbers : count"+"\n"/;
    
 int count=1;
    
 Arrays.sort/numbers/;
    
 for/int z=0;z<5;z++/{
    
 for/int j=0;j<z;j++ "+count+"\n"="" &="" -="" ;="" <="" code]="" count="1;" div="" if="" j!="z/{" numbers[z]="numbers[j]" numbers[z]+"="" system.out.print="" {="" }="" }[="">
    
<div class="answer_text">
    

    
[code]package com.core_java;
    

    
import java.util.Arrays;
    
import java.util.Scanner;
    

    
public class Sim {
    
 public static void main/String[] args/ {
    

    
 Scanner input = new Scanner/System.in/;
    
 System.out.println/"Enter array size: "/;
    
 int size = input.nextInt//;
    

    
 int[] array = new int[size];
    

    
 // Read integers from the console
    
 System.out.println/"Enter array elements: "/;
    
 for /int i = 0; i &lt; array.length; i++/ {
    
 array[i] = input.nextInt//;
    
 }
    
 Sim s = new Sim//;
    
 s.find/array/;
    
 }
    

    
 public void find/int[] arr/ {
    
 int count = 1;
    
 Arrays.sort/arr/;
    

    
 for /int i = 0; i &lt; arr.length; i++/ {
    

    
 for /int j = i + 1; j &lt; arr.length; j++/ {
    
 if /arr[i] == arr[j]/ {
    
 count++;
    
 }
    
 }
    
 if /count &gt; 1/ {
    
 System.out.println//;
    
 System.out.println/"repeated element in array " + arr[i] + ": " + count + " time/s/"/;
    
 i = i + count - 1;
    
 }
    
 count = 1;
    
 }
    
 }
    

    
}


    </div>
    <div class="answer_text">

    public class ArrayDuplicate {
    
private static Scanner sc;
    
static int totalCount = 0;
    

    
 public static void main/String[] args/ {
    
 int n, num;
    
 sc = new Scanner/System.in/;
    
 System.out.print/"Enter the size of array: "/;
    
 n =sc.nextInt//;
    
 int[] a = new int[n];
    
 for/int i=0;i<n;i++ "="" "+i+":="" "+totalcount+"="" "elements="" "enter="" "there="" ;="" a="" a[enter="" a[i]="a[j]/" a[i]+"="" are="" are:="" array="" at="" count="" count++;="" description="" duplicate="" element="" for="" here][1][i]="num;" i="0;" i<a.length;i++="" if="" image="" in="" int="" int[]="" j="i+1;" j++;="" j<a.length="" num="sc.nextInt//;" numbers:"="" position="" public="" recount="0;" recount,="" repeated="" static="" system.out.print="" system.out.println="" temp;="" the="" void="" while="" {="" }="">0/{
    
 temp = a[i];
    
 for/int x=0;x<i;x++ "+count+"="" +a[i]+"="" :="" ;="" <="" a[x]="temp/" code]="" div="" if="" recount="0/{" recount++;="" system.out.println="" times"="" totalcount++;="" {="" }="" }[="">
    
<div class="answer_text">
    

    
[code]public static void duplicatesInteger/int arr[]/{
    
 Arrays.sort/arr/; 
    
 int count=0;
    
 Set s=new HashSet//;
    
 for/int i=0;i&lt;=arr.length-1;i++/{
    
 for/int j=i+1;j&lt;=arr.length-1;j++/{
    
 if/arr[i]==arr[j] &amp;&amp; s.add/arr[i]//{
    
 count=count+1; 
    
 }
    
 }
    
 System.out.println/count/;
    
 }
    
}


    </div>
    <div class="answer_text">
    私人静态无效 getRepeatedNumbers// {


    [code]int [] numArray = {2,5,3,8,1,2,8,3,3,1,5,7,8,12,134};
    Set<integer> nums = new HashSet<integer>//;

    for /int i =0; i<numarray.length; "="" "+count+"="" "+numarray[i]+="" "the="" ;="" <="" code]="" continue;="" count="1;" count++;="" div="" for="" i++="" if="" int="" is="" j="" j++="" numarray.length;="" numarray[i]="" nums.add="" nums.contains="" repeated="" system.out.println="" times."="" {="" }="" }[="">
    <div class="answer_text">

    [code]public class FindRepeatedNumbers
    {
    public static void main/String[] args/
    {
    int num[]={1,3,2,4,1,2,4,6,7,5};
    Arrays.sort/num/;

    for/int j=1;j<num.length;j++ ;="" <="" code]="" div="" if="" num[j]="" system.out.println="" {="" }="" }[="">
    </num.length;j++></div></numarray.length;></integer></integer></div></i;x++></n;i++></div></z;j++>
    2021-03-21 0 0
    分享

    卫东

    赞同来自: 

    package com.core_java;
    

    
import java.util.Arrays;
    
import java.util.Scanner;
    

    
public class Sim {
    
 public static void main/String[] args/ {
    

    
 Scanner input = new Scanner/System.in/;
    
 System.out.println/"Enter array size: "/;
    
 int size = input.nextInt//;
    

    
 int[] array = new int[size];
    

    
 // Read integers from the console
    
 System.out.println/"Enter array elements: "/;
    
 for /int i = 0; i < array.length; i++/ {
    
 array[i] = input.nextInt//;
    
 }
    
 Sim s = new Sim//;
    
 s.find/array/;
    
 }
    

    
 public void find/int[] arr/ {
    
 int count = 1;
    
 Arrays.sort/arr/;
    

    
 for /int i = 0; i < arr.length; i++/ {
    

    
 for /int j = i + 1; j < arr.length; j++/ {
    
 if /arr[i] == arr[j]/ {
    
 count++;
    
 }
    
 }
    
 if /count > 1/ {
    
 System.out.println//;
    
 System.out.println/"repeated element in array " + arr[i] + ": " + count + " time/s/"/;
    
 i = i + count - 1;
    
 }
    
 count = 1;
    
 }
    
 }
    

    
}
    2021-03-21 0 0
    分享

    小明明

    赞同来自: 

    public class ArrayDuplicate {
    
private static Scanner sc;
    
static int totalCount = 0;
    

    
 public static void main/String[] args/ {
    
 int n, num;
    
 sc = new Scanner/System.in/;
    
 System.out.print/"Enter the size of array: "/;
    
 n =sc.nextInt//;
    
 int[] a = new int[n];
    
 for/int i=0;i<n;i++ "="" "+i+":="" "+totalcount+"="" "elements="" "enter="" "there="" ;="" a="" a[enter="" a[i]="a[j]/" a[i]+"="" are="" are:="" array="" at="" count="" count++;="" description="" duplicate="" element="" for="" here][1][i]="num;" i="0;" i<a.length;i++="" if="" image="" in="" int="" int[]="" j="i+1;" j++;="" j<a.length="" num="sc.nextInt//;" numbers:"="" position="" public="" recount="0;" recount,="" repeated="" static="" system.out.print="" system.out.println="" temp;="" the="" void="" while="" {="" }="">0/{
    
 temp = a[i];
    
 for/int x=0;x<i;x++ "+count+"="" +a[i]+"="" :="" ;="" <="" a[x]="temp/" code]="" div="" if="" recount="0/{" recount++;="" system.out.println="" times"="" totalcount++;="" {="" }="" }[="">
    
<div class="answer_text">
    

    
[code]public static void duplicatesInteger/int arr[]/{
    
 Arrays.sort/arr/; 
    
 int count=0;
    
 Set s=new HashSet//;
    
 for/int i=0;i&lt;=arr.length-1;i++/{
    
 for/int j=i+1;j&lt;=arr.length-1;j++/{
    
 if/arr[i]==arr[j] &amp;&amp; s.add/arr[i]//{
    
 count=count+1; 
    
 }
    
 }
    
 System.out.println/count/;
    
 }
    
}


    </div>
    <div class="answer_text">
    私人静态无效 getRepeatedNumbers// {


    [code]int [] numArray = {2,5,3,8,1,2,8,3,3,1,5,7,8,12,134};
    Set<integer> nums = new HashSet<integer>//;

    for /int i =0; i<numarray.length; "="" "+count+"="" "+numarray[i]+="" "the="" ;="" <="" code]="" continue;="" count="1;" count++;="" div="" for="" i++="" if="" int="" is="" j="" j++="" numarray.length;="" numarray[i]="" nums.add="" nums.contains="" repeated="" system.out.println="" times."="" {="" }="" }[="">
    <div class="answer_text">

    [code]public class FindRepeatedNumbers
    {
    public static void main/String[] args/
    {
    int num[]={1,3,2,4,1,2,4,6,7,5};
    Arrays.sort/num/;

    for/int j=1;j<num.length;j++ ;="" <="" code]="" div="" if="" num[j]="" system.out.println="" {="" }="" }[="">
    </num.length;j++></div></numarray.length;></integer></integer></div></i;x++></n;i++>
    2021-03-21 0 0
    分享

    涵秋

    赞同来自: 

    public static void duplicatesInteger/int arr[]/{
    
 Arrays.sort/arr/; 
    
 int count=0;
    
 Set s=new HashSet//;
    
 for/int i=0;i<=arr.length-1;i++/{
    
 for/int j=i+1;j<=arr.length-1;j++/{
    
 if/arr[i]==arr[j] && s.add/arr[i]//{
    
 count=count+1; 
    
 }
    
 }
    
 System.out.println/count/;
    
 }
    
}
    2021-03-21 0 0
    分享

    郭文康

    赞同来自:

    私人静态无效 getRepeatedNumbers// {


    [code]int [] numArray = {2,5,3,8,1,2,8,3,3,1,5,7,8,12,134};
    Set<integer> nums = new HashSet<integer>//;

    for /int i =0; i<numarray.length; "="" "+count+"="" "+numarray[i]+="" "the="" ;="" <="" code]="" continue;="" count="1;" count++;="" div="" for="" i++="" if="" int="" is="" j="" j++="" numarray.length;="" numarray[i]="" nums.add="" nums.contains="" repeated="" system.out.println="" times."="" {="" }="" }[="">
    <div class="answer_text">

    [code]public class FindRepeatedNumbers
    {
    public static void main/String[] args/
    {
    int num[]={1,3,2,4,1,2,4,6,7,5};
    Arrays.sort/num/;

    for/int j=1;j<num.length;j++ ;="" <="" code]="" div="" if="" num[j]="" system.out.println="" {="" }="" }[="">
    </num.length;j++></div></numarray.length;></integer></integer>
    2021-03-21 0 0
    分享

    喜特乐

    赞同来自:

    [code]public class FindRepeatedNumbers
    {
    public static void main/String[] args/
    {
    int num[]={1,3,2,4,1,2,4,6,7,5};
    Arrays.sort/num/;

    for/int j=1;j<num.length;j++ ;="" <="" code]="" div="" if="" num[j]="" system.out.println="" {="" }="" }[="">
    </num.length;j++>
    2021-03-21 0 0
    分享
    为什么被折叠? 0 个回复被折叠

    要回复问题请先登录或注册

    Copyright © 2023, All Rights Reserved