Find most common substring | Code Society | Page 1

frigid pagoda Sep 30, 2024, 8:00 PM

#

Find most common substring of str

#

;compile java

import java.util.*;
public class M {
public static String findCommonSubstring(final String str)
{
if (str == null || str.isEmpty()) return "";

final int n = str.length();
final Map<String, Integer> map = new LinkedHashMap<String, Integer>(n * n * n);
int    maxValue = 1;
String maxString = str;
for(int i = 0; i < n; ++i)
{
for(int j = i; j >= 0; --j)
if ((j-i) > 0)
{
  final String key = str.substring(j, i);
  final Integer v  = map.get(key);
  System.out.println("[" + j + "," + i + "]["+key+"] = "+ v);
  if (v == null || v.intValue() < 1)
  { map.put(key, Integer.valueOf(1)); }
  else { 
    final int x = 1 + v.intValue();
    map.put(key, Integer.valueOf(x));
    if (x > maxValue) { maxValue = x; maxString = key; }
  }
}
}
 return maxString;
}
public static void main(String[] args)
{
  final String x1 = findCommonSubstring("aa");
  System.out.println(x1);
  final String x2 = findCommonSubstring("abcd");
  System.out.println(x2);
  final String x3 = findCommonSubstring("abcdaaaaaaaaaaa");
  System.out.println(x3);
}
}

gray mistBOT Sep 30, 2024, 8:01 PM

#

Program Output

aa
abcd
abcdaaaaaaaaaaa

frigid pagoda Sep 30, 2024, 9:26 PM

#

;compile java

import java.util.*;
public class M {
public static String findCommonSubstring(final String str, int lookup)
{
if (str == null || str.isEmpty()) return "";
if (lookup < 1) { lookup = 0; }
if (str.length() < lookup) return "";

final int n = str.length();
final Map<String, Integer> map = new LinkedHashMap<String, Integer>(n * n * n);
int    maxValue = 1;
String maxString = "";
for(int i = 0; i < n; ++i)
{
for(int j = i; j >= 0; --j)
if ( ((j-i) > 0)
&& ( (lookup < 1) || ( (j-i) == lookup) )
)
{
  final String key = str.substring(j, i);
  final Integer v  = map.get(key);
  System.out.println("[" + j + "," + i + "]["+key+"] = "+ v);
  if (v == null || v.intValue() < 1)
  { map.put(key, Integer.valueOf(1)); }
  else { 
    final int x = 1 + v.intValue();
    map.put(key, Integer.valueOf(x));
    //if (x > maxValue) { maxValue = x; maxString = key; }
  }

  final int m = (j-i);
  int count = 0;
  for(int k = 0; k < (n-m); ++k)
  try
  {
    final String s = str.substring(k, k+m);
    if (key.equals(s)) { ++count; }
  }
  catch(Exception ex) {}

  System.out.println(count);
  if (count > maxValue) { maxValue = count; maxString = key; }
}
}
 return maxString;
}
public static void main(String[] args)
{
int lookup = 3;
  final String x1 = findCommonSubstring("aaa",lookup);
  System.out.println(x1);
  final String x2 = findCommonSubstring("abcd",lookup);
  System.out.println(x2);
  final String x3 = findCommonSubstring("abcdaaaaaaaaaaa",lookup);
  System.out.println(x3);
}
}

gray mistBOT Sep 30, 2024, 9:26 PM

#

Compilation successful

No output.

frigid pagoda Sep 30, 2024, 9:31 PM

#

;compile java

import java.util.*;
public class M {
  public static String findCommonSubstring(final String str, int lookup) {
    if (str == null || str.isEmpty()) return "< EMPTY >";
    if (lookup < 1) lookup = 0;
    if (str.length() < lookup) return "< TOO SMALL >";

    final int n = str.length();
    final Map<String, Integer> map = new LinkedHashMap<String, Integer>(n * n * n);
    int maxValue = 1;
    String maxString = null;
    for (int i = 0; i < n; ++i)
    {
      for (int j = i; j >= 0; --j)
        if (
          ((j - i) > 0) &&
          ((lookup < 1) || ((j - i) == lookup))
        )
        {
          final String key = str.substring(j, i);
          final Integer v = map.get(key);
          System.out.println("[" + j + "," + i + "][" + key + "] = " + v);
          if (v == null || v.intValue() < 1) {
            map.put(key, Integer.valueOf(1));
          } else {
            final int x = 1 + v.intValue();
            map.put(key, Integer.valueOf(x));
            //if (x > maxValue) { maxValue = x; maxString = key; }
          }

          final int m = (j - i);
          int count = 0;
          for (int k = 0; k < (n - m); ++k) {
            try {
              final String s = str.substring(k, k + m);
              if (key.equals(s)) {
                ++count;
              }
            }
            catch (Exception ex) {}
          }

          System.out.println(count);
          if (count > maxValue) {
            maxValue = count;
            maxString = key;
          }
        }
    }
    return maxString;
  }
  public static void main(String[] args) {
    int lookup = 3;
    final String x1 = findCommonSubstring("aaa", lookup);
    System.out.println(x1);
    final String x2 = findCommonSubstring("abcd", lookup);
    System.out.println(x2);
    final String x3 = findCommonSubstring("abcdaaaaaaaaaaa", lookup);
    System.out.println(x3);
  }
}

gray mistBOT Sep 30, 2024, 9:31 PM

#

Program Output

null
null
null

frigid pagoda Sep 30, 2024, 9:33 PM

#

;compile java

import java.util.*;
public class M {
  public static String findCommonSubstring(final String str, int lookup) {
    if (str == null || str.isEmpty()) return "< EMPTY >";
    if (lookup < 1) lookup = 0;
    if (str.length() < lookup) return "< TOO SMALL >";

    int n = str.length();
    Map<String,Integer> map = new LinkedHashMap<String,Integer>(n*n*n);
    int maxValue = -1;
    String maxString = null;
    for (int i = 0; i < n; ++i) {
      for (int j = i; j >= 0; --j) {
        int ji = i-j;
//System.out.println("[" + j + "," + i + "][" +ji + "]");
        if (ji >= 0) {
//if((lookup < 1) || (ji == lookup))
          {
            final String key = str.substring(j, i);
            final Integer v = map.get(key);
//System.out.println("[" + j + "," + i + "][" + key + "] = " + v);
            if (v == null || v.intValue() < 1) {
              map.put(key, Integer.valueOf(1));
            } else {
              final int x = 1 + v.intValue();
              map.put(key, Integer.valueOf(x));
//if (x > maxValue) { maxValue = x; maxString = key; }
            }

            int count = 0;
            for (int k = 0; k < (n - ji); ++k) {
              try {
                String s = str.substring(k, k + ji);
                if (key.equals(s)) {
                  ++count;
                }
              }catch(Exception ex){}
            }

            System.out.println(key+":"+count);
            if (count > maxValue) {
              maxValue = count;
              maxString = key;
            }
          }
        }
      }
    }
 System.out.println(maxString+"::"+maxValue );
    return maxString;
  }
  public static void main(String[] args) {
    int lookup = 3;
    final String x1 = findCommonSubstring("aaa", lookup);
    System.out.println(x1);
/*
    final String x2 = findCommonSubstring("abcd", lookup);
    System.out.println(x2);
    final String x3 = findCommonSubstring("abcdaaaaaaaaaaa", lookup);
    System.out.println(x3);*/
  }
}

#Find most common substring