tag:blogger.com,1999:blog-5872623838295077986.post6230981853971010339..comments2024-03-20T01:07:56.465-07:00Comments on JavaProblems.com - Free coding problems and exercises: Java > Array-2 >has77 (CodingBat Solution)Unknownnoreply@blogger.comBlogger14125tag:blogger.com,1999:blog-5872623838295077986.post-83783954103705162992022-06-02T10:00:00.484-07:002022-06-02T10:00:00.484-07:00This is mine. Tell me if there is a more simple wa...This is mine. Tell me if there is a more simple way.<br /><br />public boolean has77(int[] nums) {<br /> boolean match = false;<br /> for (int i = 1;i<nums.length-1;i++){<br /> if((nums[i]==7 && nums[i+1]==7)||(nums[i-1]==7 && nums[i+1]==7)||(nums[i]==7 && nums[i-1]==7)){<br /> match =true;<br /> }<br /> }<br /> return match;<br />}Anonhttps://www.blogger.com/profile/16438989626670136940noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-91816641007821122292021-12-11T14:17:35.996-08:002021-12-11T14:17:35.996-08:00public boolean has77(int[] nums) {
int found = -...public boolean has77(int[] nums) {<br /> int found = -3;<br /> for(int i = 0; i < nums.length; i++){<br /> if(nums[i] == 7){<br /> if(i - found <= 2){<br /> return true;<br /> }<br /> found = i;<br /> }<br /> }<br /> return false;<br />}<br />Gabehttps://www.blogger.com/profile/12271386999345712225noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-45512877217434895432021-10-28T21:34:19.796-07:002021-10-28T21:34:19.796-07:00splendid
splendid<br /><br />Anonymoushttps://www.blogger.com/profile/09853602016874095476noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-29294583356516255282021-10-28T08:46:14.773-07:002021-10-28T08:46:14.773-07:00public boolean has77(int[] nums)
{
for(int i...public boolean has77(int[] nums) <br />{<br /> <br /> for(int i = 2; i < nums.length; i++)<br /> {<br /> if(nums[i-2] == 7 && nums[i-1] == 7 <br /> || nums[i-2] ==7 && nums[i] == 7 <br /> || nums[i-1] == 7 && nums[i] == 7) return true;<br /> }<br /> <br /> return false;<br />}<br />Sinuserhttps://www.blogger.com/profile/08399295430731617209noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-39272222273924936812020-10-27T18:02:52.971-07:002020-10-27T18:02:52.971-07:00public static boolean has77(int[] nums) {
...public static boolean has77(int[] nums) {<br /> int len = nums.length;<br /> boolean sevens = false;<br /> for(int i=0; i<len-1; i++){<br /> if(nums[i]==7){<br /> if(nums[i+1]==7 || (i<(len-2) && nums[i+2]==7)){<br /> sevens = true;<br /> }<br /> }<br /> }<br /> return sevens;<br /><br /> }AnarAghahttps://www.blogger.com/profile/14316583626612362652noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-28138410912659503962020-04-22T17:16:44.068-07:002020-04-22T17:16:44.068-07:00public boolean has77(int[] nums) {
boolean b = f...public boolean has77(int[] nums) {<br /> boolean b = false;<br /> for (int i = 0; i < nums.length - 2; i++) <br /> if ((nums[i] == 7 && nums[i] == nums[i+1]) || ((nums[i] == 7 && nums[i] != nums[i+1]) && nums[i] == nums[i+2]) || (nums[i] != 7 && nums[i+1] == 7) && nums[i+1] == nums[i+2]) <br /> b = true;<br /> return b;<br />}<br />GoofyCoderhttps://www.blogger.com/profile/17015688702910185929noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-70625356576474010882020-04-13T08:03:01.144-07:002020-04-13T08:03:01.144-07:00public boolean has77(int[] nums) {
boolean bool ...public boolean has77(int[] nums) {<br /> boolean bool = false;<br /> <br /> for( int i = 0; i < nums.length - 2; i++ ) {<br /> if( nums[i] == 7 && (7 == nums[i+2] || 7 == nums[i+1]) ){<br /> bool = true;<br /> }<br /> if( nums[i+1] == 7 && nums[i+2] == 7 ){ <br /> bool = true;<br /> }<br /> }<br /> return bool;<br />}<br />Anonymoushttps://www.blogger.com/profile/07614982807040602545noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-11355584259277336642020-04-12T16:50:17.489-07:002020-04-12T16:50:17.489-07:00public boolean has77(int[] nums) {
for(int i=0; ...public boolean has77(int[] nums) {<br /> for(int i=0; i<nums.length;i++){<br /> if(i+1<nums.length && nums[i]==7 && nums[i+1]==7 ){<br /> return true;<br /> }<br /> <br /> else if(i+2<nums.length && nums[i]==7 && nums[i+2]==7 ){<br /> return true;<br /> }<br /> }<br /> <br /> return false;<br />}<br />LearningCodinghttps://www.blogger.com/profile/14518262250464273436noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-41869605675924391242019-06-20T04:27:52.844-07:002019-06-20T04:27:52.844-07:00public boolean has77(int[] nums) {
for (int i =0...public boolean has77(int[] nums) {<br /> for (int i =0; i < nums.length -2; i++) {<br /> if (nums[i] == 7 && ( nums[i+1] == 7 || nums[i+2] == 7)) return true;<br /> if (nums[i+1] == 7 && nums[i+2] == 7) return true;<br /> }<br /> return false;<br />}lakohothttps://www.blogger.com/profile/09029796919224798604noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-3945759678491964612019-02-12T17:14:55.509-08:002019-02-12T17:14:55.509-08:00public boolean has77(int[] nums) {
for(int i=1;i...public boolean has77(int[] nums) {<br /> for(int i=1;i<nums.length;i++){<br /> if(nums[i]==7 && nums[i-1]==7){<br /> return true;<br /> }else if(i<nums.length-1 && nums[i-1]==7 && nums[i]!=7 && nums[i+1]==7){<br /> return true;<br /> }<br /> }<br /> return false;<br />}刷LeetCode的解題技巧https://www.blogger.com/profile/15092250662129403648noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-30098556740096207802018-09-14T03:47:01.062-07:002018-09-14T03:47:01.062-07:00public boolean has77(int[] nums) {
boolean flag ...public boolean has77(int[] nums) {<br /> boolean flag = false;<br /> <br /> for(int i = 0; i < nums.length-2; i++){<br /> if((nums[i] == 7 && nums[i +1] == 7)|| <br /> (nums[i] == 7 && nums[i +2] == 7) ||<br /> (nums[nums.length-2] == 7 && nums[nums.length-1] == 7)){<br /> flag = true;<br /> }<br /> }<br /> return flag;<br />}<br />Anonymoushttps://www.blogger.com/profile/08486523629407132652noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-30128746341554314222018-01-03T14:07:48.062-08:002018-01-03T14:07:48.062-08:00public boolean has77(int[] nums) {
boolean result ...public boolean has77(int[] nums) {<br />boolean result = false;<br /> <br /> for (int i = 0; i < nums.length-1; i++)<br /> if ((nums[i] == 7 && nums[i+1] == 7))<br /> result = true;<br /> <br /> for (int i = 0; i < nums.length-2; i++)<br /> if ((nums[i] == 7 && nums[i+2] == 7))<br /> result = true;<br /> return result;<br />}Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-3149570835248754522015-01-10T23:20:06.879-08:002015-01-10T23:20:06.879-08:00public boolean has77(int [] nums){
for(int x = ...public boolean has77(int [] nums){<br /> for(int x = 0; x < nums.length-2; x++){<br /> if(int[x] == 7 && int[x+1] == 7){<br /> return true;<br /> }<br /> if(int[x] == 7 && int [x+2] == 7){<br /> return true;<br /> }<br /> if(int[x+1] == 7 && int [x+2] == 7){<br /> return true;<br /> }<br /> }<br />return false;<br />}Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-22796573919180170012015-01-10T23:05:42.664-08:002015-01-10T23:05:42.664-08:00Why pass through twice?
public boolean has77(int[...Why pass through twice?<br /><br />public boolean has77(int[] nums) {<br /> for(int i = 0; i<nums.length-1;i++)<br /> {<br /> if(nums[i]==7 && (nums[i+1]==7 || (i<nums.length-2&&nums[i+2]==7))) return true;<br /> }<br /> return false;<br />}<br />Anonymoushttps://www.blogger.com/profile/13570069804657463127noreply@blogger.com