{"id":1296,"date":"2015-03-31T11:58:21","date_gmt":"2015-03-31T09:58:21","guid":{"rendered":"http:\/\/www.webotlet.hu\/?p=1296"},"modified":"2015-03-31T14:12:39","modified_gmt":"2015-03-31T12:12:39","slug":"java-egyperces-hanyszor-van-benne-az-adott-string-megoldasa","status":"publish","type":"post","link":"https:\/\/www.webotlet.hu\/?p=1296","title":{"rendered":"Java egyperces &#8211; H\u00e1nyszor van benne az adott String megold\u00e1sa"},"content":{"rendered":"<h3><strong>Csak akkor olvass tov\u00e1bb, ha a\u00a0<a title=\"Java egyperces \u2013 H\u00e1nyszor van benne az adott String?\" href=\"http:\/\/www.webotlet.hu\/?p=1292\">H\u00e1nyszor van benne az adott String<\/a> feladatot megoldottad, vagy nem siker\u00fclt megoldani.<\/strong><\/h3>\n<p>L\u00e1ssuk akkor a feladatok megold\u00e1sait. Az egyes v\u00e1ltozatok teljesen elt\u00e9r\u0151 megk\u00f6zel\u00edt\u00e9st alkalmaznak.<\/p>\n<h4>1. v\u00e1ltozat<\/h4>\n<pre class=\"brush: java; title: ; notranslate\" title=\"\">\r\nString hol = &quot;KKNDDKDKKNKDEDNNENNNNNEKNEEEDKNK&quot;+\r\n             &quot;EEEDKDDNDKDEKEDKNKKDEENKEKKDKEND&quot;+\r\n             &quot;KNNDDDKNDNDDDNEKNEDENDEEDKDDDNDN&quot;+\r\n             &quot;NEDEKNENNEEKDEKKDKKEEEDKDNNKKDNN&quot;+\r\n             &quot;NEDEKKNEEENKKKDEKDKKKN&quot;;\r\n\r\nString mit = &quot;KKN&quot;;\r\nint db = 0;\r\nfor( int i = 0; i &lt; hol.length()-2; i++ )\r\n{\r\n\u00a0 if( hol.substring(i,i+3).equals(mit) )\r\n\u00a0 {\r\n\u00a0\u00a0\u00a0 db++;\r\n\u00a0 }\r\n}\r\nSystem.out.println( db );\r\n<\/pre>\n<h4>2. v\u00e1ltozat<\/h4>\n<pre class=\"brush: java; title: ; notranslate\" title=\"\">\r\nString hol = &quot;KKNDDKDKKNKDEDNNENNNNNEKNEEEDKNK&quot;+\r\n             &quot;EEEDKDDNDKDEKEDKNKKDEENKEKKDKEND&quot;+\r\n             &quot;KNNDDDKNDNDDDNEKNEDENDEEDKDDDNDN&quot;+\r\n             &quot;NEDEKNENNEEKDEKKDKKEEEDKDNNKKDNN&quot;+\r\n             &quot;NEDEKKNEEENKKKDEKDKKKN&quot;;\r\n\r\nString mit = &quot;KKN&quot;;\r\nint db = 0;\r\n\r\nboolean van = hol.contains( mit );\r\nwhile( van )\r\n{\r\n\u00a0 db++;\r\n\u00a0 hol = hol.replaceFirst( mit, &quot;&quot; );\r\n  van = hol.contains( mit );\r\n}\r\nSystem.out.println( db );\r\n<\/pre>\n<h4>3. v\u00e1ltozat (ehhez m\u00e1r gondolkodni sem \u00e1rt)<\/h4>\n<pre class=\"brush: java; title: ; notranslate\" title=\"\">\r\nString hol = &quot;KKNDDKDKKNKDEDNNENNNNNEKNEEEDKNK&quot;+\r\n             &quot;EEEDKDDNDKDEKEDKNKKDEENKEKKDKEND&quot;+\r\n             &quot;KNNDDDKNDNDDDNEKNEDENDEEDKDDDNDN&quot;+\r\n             &quot;NEDEKNENNEEKDEKKDKKEEEDKDNNKKDNN&quot;+\r\n             &quot;NEDEKKNEEENKKKDEKDKKKN&quot;;\r\n\r\nString mit = &quot;KKN&quot;;\r\n\/\/ csak r\u00f6vid\u00edt\u00e9s miatt, hogy elf\u00e9rjen egy sorba a k\u00f3d\r\nint db = (hol.length() - hol.replaceAll( mit, &quot;&quot; ).length()) \/ mit.length();\r\n\r\nSystem.out.println( db );\r\n<\/pre>\n<h4>4. v\u00e1ltozat (ehhez meg j\u00f3l kell ismerni a Stringeket)<\/h4>\n<pre class=\"brush: java; title: ; notranslate\" title=\"\">\r\nString hol = &quot;KKNDDKDKKNKDEDNNENNNNNEKNEEEDKNK&quot;+\r\n             &quot;EEEDKDDNDKDEKEDKNKKDEENKEKKDKEND&quot;+\r\n             &quot;KNNDDDKNDNDDDNEKNEDENDEEDKDDDNDN&quot;+\r\n             &quot;NEDEKNENNEEKDEKKDKKEEEDKDNNKKDNN&quot;+\r\n             &quot;NEDEKKNEEENKKKDEKDKKKN&quot;;\r\n\r\nString mit = &quot;KKN&quot;;\r\nSystem.out.println( hol.split( mit, -1 ).length-1 );\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Csak akkor olvass tov\u00e1bb, ha a\u00a0H\u00e1nyszor van benne az adott String feladatot megoldottad, vagy nem siker\u00fclt megoldani. L\u00e1ssuk akkor a feladatok megold\u00e1sait. Az egyes v\u00e1ltozatok teljesen elt\u00e9r\u0151 megk\u00f6zel\u00edt\u00e9st alkalmaznak. 1. v\u00e1ltozat String hol = &quot;KKNDDKDKKNKDEDNNENNNNNEKNEEEDKNK&quot;+ &quot;EEEDKDDNDKDEKEDKNKKDEENKEKKDKEND&quot;+ &quot;KNNDDDKNDNDDDNEKNEDENDEEDKDDDNDN&quot;+ &quot;NEDEKNENNEEKDEKKDKKEEEDKDNNKKDNN&quot;+ &quot;NEDEKKNEEENKKKDEKDKKKN&quot;; String <a class=\"more-link\" href=\"https:\/\/www.webotlet.hu\/?p=1296\">Tov\u00e1bb <span class=\"screen-reader-text\">  Java egyperces &#8211; H\u00e1nyszor van benne az adott String megold\u00e1sa<\/span><span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[95],"tags":[31,86,29],"class_list":["post-1296","post","type-post","status-publish","format-standard","hentry","category-egyperces-feladatok-megoldasai","tag-ciklus","tag-java","tag-string"],"_links":{"self":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1296","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1296"}],"version-history":[{"count":7,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1296\/revisions"}],"predecessor-version":[{"id":1311,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=\/wp\/v2\/posts\/1296\/revisions\/1311"}],"wp:attachment":[{"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1296"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1296"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.webotlet.hu\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1296"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}