手写简单的三道算法题

packagecom.bjsxt;

importjava.util.Arrays;

publicclassRemoveDuplication {

   publicstaticint[] removeDuplicates(inta[]) {

        if(a.length <= 1) {

            returna;

        }

        intindex = 0;

        for(inti = 1; i < a.length; i++) {

            if(a[index] != a[i]) {

                a[++index] = a[i];

            }

        }

        int[] b = newint[index + 1];

        System.arraycopy(a, 0, b, 0, b.length);

        returnb;

   }

   publicstaticvoidmain(String[] args) {

        int[] a = {1, 1, 2, 2, 3};

        a = removeDuplicates(a);

        System.out.println(Arrays.toString(a));

   }

}

packagecom.bjsxt;

publicclassFindMost {

   publicstatic<T> T find(T[] x){

      T temp = null;

      for(inti = 0, nTimes = 0; i< x.length;i++) {

          if(nTimes == 0) {

              temp= x[i];

              nTimes= 1;

          }

          else{

              if(x[i].equals(temp)) {

                  nTimes++;

              }

              else{

                  nTimes--;

              }

          }

      }

      returntemp;

   }

   publicstaticvoidmain(String[] args) {

      String[]strs = {"hello","kiss","hello","hello","maybe"};

      System.out.println(find(strs));

   }

}

publicintgetWordCount(String s)

   {

       intlength = 0;

       for(inti = 0; i < s.length(); i++)

       {

           intascii = Character.codePointAt(s, i);

           if(ascii >= 0&& ascii <=255)

               length++;

           else

               length += 2;

       }

       returnlength;

   }