Problem:
Return the sum of the numbers in the array, except ignore sections of numbers starting with a 6 and extending to the next 7 (every 6 will be followed by at least one 7). Return 0 for no numbers.
sum67({1, 2, 2}) → 5
sum67({1, 2, 2, 6, 99, 99, 7}) → 5
sum67({1, 1, 6, 7, 2}) → 4
Solution:
public int sum67(int[] nums) {
int sum = 0;
boolean stop = false;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == 6)
stop = true;
if (stop == false)
sum += nums[i];
if (nums[i] == 7 && stop == true)
stop = false;
}
return sum;
}
public int sum67(int[] nums) {
ReplyDeleteint sum = 0;
for (int i = 0; i < nums.length; i++) {
if(nums[i] != 6) sum = sum + nums[i];
else while(nums[i] != 7) i++;
}
return sum;
}
int sum = 0;
ReplyDeletefor(int i = 0;i<nums.length;i++){
if(nums[i]==6){
for(int j = i;j<nums.length;j++){
if(nums[j]==7){
i = j;
break;
}
}
continue;
}
sum+=nums[i];
}
return sum;
public int sum67(int[] nums) {
ReplyDeleteif(nums.length == 0) return 0;
int sum = 0;
for(int i = 0; i < nums.length; i++) {
if(nums[i] == 6) {
i++;
while(nums[i] != 7 && i < nums.length) i++;
} else {
sum += nums[i];
}
}
return sum;
}
public int sum67(int[] nums) {
ReplyDeleteint sum =0;
int i, j;
if(nums.length>0){
for( i=0; i<nums.length;i++){
if(nums[i]==6){
for( j=i; nums[j]!=7;j++){
i=i+1;
}
}
else{
sum = sum+nums[i];
}
}
}
return sum;
}
public int sum67(int[] nums) {
ReplyDeleteint sum = 0;
for (int i = 0; i <= nums.length-1; i++) {
if(nums[i] != 6)
sum = sum + nums[i];
else
while(nums[i] != 7) i++;
}
return sum;
}
int sum=0;
ReplyDeletefor(int i=0;i<nums.length; i++){
if(nums[i]==6){
while(nums[i]!=7)
i++;
continue;
}else{
sum+=nums[i];
}
}return sum;
int sum = 0;
ReplyDeletefor (int i = 0; i < nums.length; i++){
if (nums[i]==6){
while (nums[i] != 7){
i++;
}
sum-=7;
}
sum+= nums[i];
} return sum;
public int sum67(int[] nums) {
ReplyDeleteint sum = 0;
boolean appear = true;
for(int i=0; i<nums.length; i++) {
if(nums[i]!=6 && appear==true) {
sum += nums[i];
} else if(nums[i]==6) {
appear = false;
} else if(nums[i-1]==7 && i<nums.length) {
appear = true;
sum += nums[i];
}
}
return sum;
}