Combinational string search using Java Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Output strings from a set in lexicographical orderSimplified regular expression engineUsing Levenstein distance to compare stringsBalanced parenthesesMatch Simple Sentence or Partial SentenceFind the first unique character in a stringDid you twist my words?Filtering user input to not contain a specific characterEffective way to find two string are anagramsSimple pattern matching between two string inputs using Java (Google interview challenge)

Why use gamma over alpha radiation?

Direct Experience of Meditation

How to market an anarchic city as a tourism spot to people living in civilized areas?

What kind of display is this?

Cold is to Refrigerator as warm is to?

How should I respond to a player wanting to catch a sword between their hands?

Do working physicists consider Newtonian mechanics to be "falsified"?

Classification of bundles, Postnikov towers, obstruction theory, local coefficients

What's the point in a preamp?

Writing Thesis: Copying from published papers

What computer would be fastest for Mathematica Home Edition?

Strange behaviour of Check

Is above average number of years spent on PhD considered a red flag in future academia or industry positions?

Are my PIs rude or am I just being too sensitive?

I'm thinking of a number

Stop battery usage [Ubuntu 18]

Working around an AWS network ACL rule limit

What would be Julian Assange's expected punishment, on the current English criminal law?

What did Darwin mean by 'squib' here?

What was the last x86 CPU that did not have the x87 floating-point unit built in?

Two different pronunciation of "понял"

Who can trigger ship-wide alerts in Star Trek?

Single author papers against my advisor's will?

Interesting examples of non-locally compact topological groups



Combinational string search using Java



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Output strings from a set in lexicographical orderSimplified regular expression engineUsing Levenstein distance to compare stringsBalanced parenthesesMatch Simple Sentence or Partial SentenceFind the first unique character in a stringDid you twist my words?Filtering user input to not contain a specific characterEffective way to find two string are anagramsSimple pattern matching between two string inputs using Java (Google interview challenge)



.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








1












$begingroup$


I wrote a program that receives 2 strings (Input and Search) in the Search string. The sign '+' indicates that if the substring before the '+' exists in the Input string. (The search string cannot start with '+' and there cannot be a '+' followed by another '+').



Can you review it for best coding practices and efficiency?



boolean notgood = false;
boolean break1 = false;
boolean break2 = false;
int counter = 0;

if (search.charAt(0)=='+'||search.charAt(0)=='*')

System.out.println("Invalid search striNG.");
continue;

//////////////////////////////////////////////
for (i=0; i<search.length() && notgood==false; i++) (search.charAt(i)=='+'))

if (i!=search.length()-1) (search.charAt(i+1)=='+'))

System.out.println("INvalid search string.");
notgood=true;
break1=true;




////////////////////////////////////////////
for (i=0; i<search.length() && !break1; i++) {

int c=0;

if (search.charAt(i)=='+')

String word = search.substring(0,i);

for (int j=0; j<input.length() && !break2; j++)

if ((input.charAt(j) == word.charAt(c)) && c<word.length())
c++;

if (c>=word.length())

System.out.println("Search string matches input string.");
break1=true;
break2=true;



if (c<word.length())
System.out.println("Search string doesn't match input string.");




For example, for Input = 'abcd' and Search = 'ab+cd+', the result should be the strings match.










share|improve this question









New contributor




Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    Request for clarification: does ab+cd+ indicate that the two substring which should be present are “ab” and “cd” or is it everything to the left of the +, thus “ab” and “abcd” should be contained? In other words, does the filter “to the left of +” stop when it encounters another plus?
    $endgroup$
    – DapperDan
    5 hours ago











  • $begingroup$
    I also noticed you check in the beginning for “*”. What does this character mean in the context of your program?
    $endgroup$
    – DapperDan
    5 hours ago






  • 1




    $begingroup$
    Welcome to Code Review! Please read the article on How to write a good question in the Help Center. Update the title of your question after reading. Additionally, fix your code so that it's complete, runnable and working.
    $endgroup$
    – Alex
    4 hours ago

















1












$begingroup$


I wrote a program that receives 2 strings (Input and Search) in the Search string. The sign '+' indicates that if the substring before the '+' exists in the Input string. (The search string cannot start with '+' and there cannot be a '+' followed by another '+').



Can you review it for best coding practices and efficiency?



boolean notgood = false;
boolean break1 = false;
boolean break2 = false;
int counter = 0;

if (search.charAt(0)=='+'||search.charAt(0)=='*')

System.out.println("Invalid search striNG.");
continue;

//////////////////////////////////////////////
for (i=0; i<search.length() && notgood==false; i++) (search.charAt(i)=='+'))

if (i!=search.length()-1) (search.charAt(i+1)=='+'))

System.out.println("INvalid search string.");
notgood=true;
break1=true;




////////////////////////////////////////////
for (i=0; i<search.length() && !break1; i++) {

int c=0;

if (search.charAt(i)=='+')

String word = search.substring(0,i);

for (int j=0; j<input.length() && !break2; j++)

if ((input.charAt(j) == word.charAt(c)) && c<word.length())
c++;

if (c>=word.length())

System.out.println("Search string matches input string.");
break1=true;
break2=true;



if (c<word.length())
System.out.println("Search string doesn't match input string.");




For example, for Input = 'abcd' and Search = 'ab+cd+', the result should be the strings match.










share|improve this question









New contributor




Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$







  • 1




    $begingroup$
    Request for clarification: does ab+cd+ indicate that the two substring which should be present are “ab” and “cd” or is it everything to the left of the +, thus “ab” and “abcd” should be contained? In other words, does the filter “to the left of +” stop when it encounters another plus?
    $endgroup$
    – DapperDan
    5 hours ago











  • $begingroup$
    I also noticed you check in the beginning for “*”. What does this character mean in the context of your program?
    $endgroup$
    – DapperDan
    5 hours ago






  • 1




    $begingroup$
    Welcome to Code Review! Please read the article on How to write a good question in the Help Center. Update the title of your question after reading. Additionally, fix your code so that it's complete, runnable and working.
    $endgroup$
    – Alex
    4 hours ago













1












1








1





$begingroup$


I wrote a program that receives 2 strings (Input and Search) in the Search string. The sign '+' indicates that if the substring before the '+' exists in the Input string. (The search string cannot start with '+' and there cannot be a '+' followed by another '+').



Can you review it for best coding practices and efficiency?



boolean notgood = false;
boolean break1 = false;
boolean break2 = false;
int counter = 0;

if (search.charAt(0)=='+'||search.charAt(0)=='*')

System.out.println("Invalid search striNG.");
continue;

//////////////////////////////////////////////
for (i=0; i<search.length() && notgood==false; i++) (search.charAt(i)=='+'))

if (i!=search.length()-1) (search.charAt(i+1)=='+'))

System.out.println("INvalid search string.");
notgood=true;
break1=true;




////////////////////////////////////////////
for (i=0; i<search.length() && !break1; i++) {

int c=0;

if (search.charAt(i)=='+')

String word = search.substring(0,i);

for (int j=0; j<input.length() && !break2; j++)

if ((input.charAt(j) == word.charAt(c)) && c<word.length())
c++;

if (c>=word.length())

System.out.println("Search string matches input string.");
break1=true;
break2=true;



if (c<word.length())
System.out.println("Search string doesn't match input string.");




For example, for Input = 'abcd' and Search = 'ab+cd+', the result should be the strings match.










share|improve this question









New contributor




Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




I wrote a program that receives 2 strings (Input and Search) in the Search string. The sign '+' indicates that if the substring before the '+' exists in the Input string. (The search string cannot start with '+' and there cannot be a '+' followed by another '+').



Can you review it for best coding practices and efficiency?



boolean notgood = false;
boolean break1 = false;
boolean break2 = false;
int counter = 0;

if (search.charAt(0)=='+'||search.charAt(0)=='*')

System.out.println("Invalid search striNG.");
continue;

//////////////////////////////////////////////
for (i=0; i<search.length() && notgood==false; i++) (search.charAt(i)=='+'))

if (i!=search.length()-1) (search.charAt(i+1)=='+'))

System.out.println("INvalid search string.");
notgood=true;
break1=true;




////////////////////////////////////////////
for (i=0; i<search.length() && !break1; i++) {

int c=0;

if (search.charAt(i)=='+')

String word = search.substring(0,i);

for (int j=0; j<input.length() && !break2; j++)

if ((input.charAt(j) == word.charAt(c)) && c<word.length())
c++;

if (c>=word.length())

System.out.println("Search string matches input string.");
break1=true;
break2=true;



if (c<word.length())
System.out.println("Search string doesn't match input string.");




For example, for Input = 'abcd' and Search = 'ab+cd+', the result should be the strings match.







java beginner strings search






share|improve this question









New contributor




Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited 1 min ago









Emma

2041215




2041215






New contributor




Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 5 hours ago









Lior RozLior Roz

61




61




New contributor




Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Lior Roz is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







  • 1




    $begingroup$
    Request for clarification: does ab+cd+ indicate that the two substring which should be present are “ab” and “cd” or is it everything to the left of the +, thus “ab” and “abcd” should be contained? In other words, does the filter “to the left of +” stop when it encounters another plus?
    $endgroup$
    – DapperDan
    5 hours ago











  • $begingroup$
    I also noticed you check in the beginning for “*”. What does this character mean in the context of your program?
    $endgroup$
    – DapperDan
    5 hours ago






  • 1




    $begingroup$
    Welcome to Code Review! Please read the article on How to write a good question in the Help Center. Update the title of your question after reading. Additionally, fix your code so that it's complete, runnable and working.
    $endgroup$
    – Alex
    4 hours ago












  • 1




    $begingroup$
    Request for clarification: does ab+cd+ indicate that the two substring which should be present are “ab” and “cd” or is it everything to the left of the +, thus “ab” and “abcd” should be contained? In other words, does the filter “to the left of +” stop when it encounters another plus?
    $endgroup$
    – DapperDan
    5 hours ago











  • $begingroup$
    I also noticed you check in the beginning for “*”. What does this character mean in the context of your program?
    $endgroup$
    – DapperDan
    5 hours ago






  • 1




    $begingroup$
    Welcome to Code Review! Please read the article on How to write a good question in the Help Center. Update the title of your question after reading. Additionally, fix your code so that it's complete, runnable and working.
    $endgroup$
    – Alex
    4 hours ago







1




1




$begingroup$
Request for clarification: does ab+cd+ indicate that the two substring which should be present are “ab” and “cd” or is it everything to the left of the +, thus “ab” and “abcd” should be contained? In other words, does the filter “to the left of +” stop when it encounters another plus?
$endgroup$
– DapperDan
5 hours ago





$begingroup$
Request for clarification: does ab+cd+ indicate that the two substring which should be present are “ab” and “cd” or is it everything to the left of the +, thus “ab” and “abcd” should be contained? In other words, does the filter “to the left of +” stop when it encounters another plus?
$endgroup$
– DapperDan
5 hours ago













$begingroup$
I also noticed you check in the beginning for “*”. What does this character mean in the context of your program?
$endgroup$
– DapperDan
5 hours ago




$begingroup$
I also noticed you check in the beginning for “*”. What does this character mean in the context of your program?
$endgroup$
– DapperDan
5 hours ago




1




1




$begingroup$
Welcome to Code Review! Please read the article on How to write a good question in the Help Center. Update the title of your question after reading. Additionally, fix your code so that it's complete, runnable and working.
$endgroup$
– Alex
4 hours ago




$begingroup$
Welcome to Code Review! Please read the article on How to write a good question in the Help Center. Update the title of your question after reading. Additionally, fix your code so that it's complete, runnable and working.
$endgroup$
– Alex
4 hours ago










0






active

oldest

votes












Your Answer






StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);






Lior Roz is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217453%2fcombinational-string-search-using-java%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes








Lior Roz is a new contributor. Be nice, and check out our Code of Conduct.









draft saved

draft discarded


















Lior Roz is a new contributor. Be nice, and check out our Code of Conduct.












Lior Roz is a new contributor. Be nice, and check out our Code of Conduct.











Lior Roz is a new contributor. Be nice, and check out our Code of Conduct.














Thanks for contributing an answer to Code Review Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217453%2fcombinational-string-search-using-java%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar