Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package basic.lesson2.tasks;
- public class GetStat {
- public static void main(String[] args) {
- String aa = "hellohello";
- char[] ca = aa.toCharArray();
- stat(ca);
- }
- public static void print(int[] na, char[] ss){
- for (int i=0;i<na.length;i++){
- System.out.println(ss[i]+"="+na[i]);
- }
- }
- public static void deleteDublicates(int[] na, char[] ss){
- int[] na1 = new int[na.length];
- char[] ss1 = new char[na.length];
- boolean flag;
- for (int i=0;i<na.length;i++){
- System.out.println(ss[i]+"="+na[i]);
- flag=false;
- for (int j=0;j<na.length;j++){
- if (na[i]==na[j]){
- flag=true;
- continue;
- }
- if (!flag){
- na1[i]=na[i];
- ss1[i]=ss[i];
- }
- }
- }
- print(na1, ss1);
- }
- public static void stat(char[] ac){
- char t;
- int n;
- boolean flag;
- int[] na = new int[ac.length];
- char[] ss = new char[ac.length];
- for (int i=0;i<ac.length;i++){
- // System.out.println(ac[i]);
- t=ac[i];
- n =0;
- for (int j=0;j<ac.length;j++){
- if (t == ac[j] && j!=i){
- n++;
- }else if (t == ac[j] && j==i){
- n++;
- }
- ss[i]=t;
- na[i]=n;
- // System.out.println("t="+t+" n="+n+" ac["+i+"]="+ac[j]);
- }
- // for (int p=0;p<ac.length;p++){
- // System.out.println("p="+p);
- // flag = true;
- // for (int j=0;j<ac.length;j++){
- // if (t == ss[j]){
- // flag = false; //уже есть в массиве
- // System.out.println("false - уже есть "+ "t="+t+" ss["+j+"]="+ss[j]+ "n="+n + " p="+p);
- // }
- // }
- //
- // if (flag){
- // ss[p]=t;
- // na[p]=n;
- // System.out.println("true "+ "t="+t+" n="+n + " ss["+p+"]="+ss[p]);
- // }
- //
- //
- //
- //// System.out.println("t="+t+" n="+n + " i="+i);
- // }
- }
- // print(na, ss);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement