If you can review this code please see what you think about it
please give me some feedback?
public static boolean partialmatching(string str1, string str2, int N)
{
int count = 0;
for...
Type: Posts; User: mgutierrez19
If you can review this code please see what you think about it
please give me some feedback?
public static boolean partialmatching(string str1, string str2, int N)
{
int count = 0;
for...
what do you think about this code can you look over it I think I might be done
public static boolean partialmatching(string str1, string str2, int N)
{
for (int i = 0; i < str2.length();...
yes the letters can be found anywhere but as long as their in consecutive order
okay sorry I am asking so many questions but I'm stuck on this method for the longest time i greatly appreciate the time your taking to help me
public static boolean partialmatching(string str1,...
inside the curlys where you put test wrap around bit in comments what did you mean by that?
an algorithm would be nice cause i have this so far
public static boolean partialmatching(string str1, string str2, Int N)
{
int count = 0
for (int i = 0; i < Str1.length(); i++)
{
...
I have to write a Method that is of the type boolean contains string1, string 2, and Int(N)
The method must Checks if a given percentage of string2 (given by N) is a substring of string1
can...