Java > Array-2 > tripleUp (CodingBat Solution)

Problem:

Return true if the array contains, somewhere, three increasing adjacent numbers like .... 4, 5, 6, ... or 23, 24, 25.

tripleUp({1, 4, 5, 6, 2}) → true
tripleUp({1, 2, 3}) → true
tripleUp({1, 2, 4}) → false


Solution:

public boolean tripleUp(int[] nums) {
  boolean foo = false;
  int count = 0;
  
  for (int i = 0; i < nums.length; i++) {
    if (i < nums.length-1) {
      int sum = nums[i+1] - nums[i];
      if (sum == 1)
        count++;
      else
        count = 0;
    }
    if (count == 2)
      foo = true;
  }
  return foo;
}

10 comments:

  1. BrochoMarch 12, 2017 at 5:57 PM

    My solution:

    public boolean tripleUp(int[] nums) {

    for (int i = 0; i < nums.length -1; i++) {
    if (i > 0 && nums[i] - 1 == nums[i-1] && nums[i+1] - 1 == nums[i]) {
    return true;
    }
    }

    return false;
    }

    ReplyDelete
  2. AnonymousJune 21, 2017 at 1:38 AM

    public boolean tripleUp(int[] nums) {
    for(int i=0; i<nums.length-2; i++){
    if( nums[i+2]-nums[i+1]==1 && nums[i+1]-nums[i]==1) return true;
    }
    return false;
    }

    ReplyDelete
  3. UnknownOctober 13, 2018 at 10:36 AM

    public boolean tripleUp(int[] nums) {
    boolean res = false;
    for (int i=0; i<nums.length-2; i++){
    if (nums[i]+1 == nums[i+1] && nums[i]+2 == nums[i+2]) res = true;
    }
    return res;
    }

    ReplyDelete
  4. UnknownAugust 23, 2020 at 10:12 AM

    public boolean tripleUp(int[] nums) {
    boolean triple = false;
    for(int i=0; i1 && nums[i-2]+1==nums[i-1] && nums[i-1]+1==nums[i])
    triple = true;
    }
    return triple;
    }

    ReplyDelete
  5. AnonymousSeptember 18, 2020 at 3:58 AM

    public int[] shiftLeft(int[] nums) {
    int tmp;
    for (int i = 0; i < nums.length - 1; i++){
    tmp = nums[i];
    nums[i] = nums[i + 1];
    nums[i + 1] = tmp;
    }
    return nums;
    }

    ReplyDelete
  6. MorganSmellmanOctober 4, 2020 at 8:26 PM

    public boolean tripleUp(int[] nums) {
    for (int i = 0; i < nums.length - 2; i ++) {
    if (nums[i+1] == nums[i] + 1 && nums[i+2] == nums[i] + 2)
    return true;
    }
    return false;
    }

    ReplyDelete
  7. UnknownOctober 30, 2020 at 9:52 AM

    public boolean tripleUp(int[] nums)
    {
    boolean res=false;
    for(int i=0;i<nums.length-2;i++)
    {
    if(nums[i]==nums[i+1]-1 && nums[i]==nums[i+2]-2)
    res=true;
    }
    return res;
    }

    ReplyDelete
  8. Anmol ParikhMarch 24, 2021 at 11:18 PM

    public boolean tripleUp(int[] nums) {
    for(int i=0;i<nums.length-2;i++){
    if((nums[i+2]-nums[i+1]==1)&&(nums[i+1]-nums[i]==1))
    return true;
    }return false;
    }

    ReplyDelete
  9. ambanielphasMarch 30, 2022 at 12:06 AM

    public boolean tripleUp(int[] nums) {
    for(int i=0; i < nums.length-2; i++){
    if((nums[i] + 1 == nums[i+1]) && (nums[i+1] + 1 == nums[i+2])){
    return true;
    }
    }

    return false;
    }

    ReplyDelete
  10. AnonymousSeptember 20, 2023 at 10:44 PM

    public boolean tripleUp(int[] nums) {
    boolean flag = false;
    int temp = 0;
    int temp2 = 0;
    for(int i=0; i<nums.length-2 ; i++){
    temp=nums[i]+1;
    temp2=nums[i]+2;
    if(nums[i+1]==temp && nums[i+2]==temp2){
    flag = true;
    }

    }
    return flag;
    }

    ReplyDelete