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 result = false;
  for (int i =0;i < nums.length-2;i++)
  if ( (nums[i] + 1 == nums[i+1]) && (nums[i+1] + 1 == nums[i+2]) )
  result = true;
  return result;
}

11 comments:

  1. UnknownApril 4, 2014 at 12:19 PM

    If we take {1,2,3,4,5,6,7} then it shows FALSE.

    ReplyDelete
    Replies
    1. UnknownApril 9, 2017 at 8:02 AM

      static 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;
      }

      Delete
  2. UnknownAugust 25, 2018 at 12:32 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
  3. fergcodyJanuary 4, 2019 at 3:32 PM

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

    ReplyDelete
  4. AnonymousMarch 6, 2019 at 1:46 AM

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

    ReplyDelete
  5. DIVRITMay 20, 2020 at 12:05 AM

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

    ReplyDelete
  6. AnarAghaNovember 9, 2020 at 7:53 AM

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

    ReplyDelete
  7. UnknownMarch 5, 2021 at 10:16 AM

    Could you solve this quesstion using Python? Thanks a lot:)

    ReplyDelete
  8. Cema2009June 7, 2022 at 7:27 PM

    With Java Stream

    public static boolean tripleUp(int[] nums) {
    return IntStream.range(0, nums.length - 2).anyMatch(i -> nums[i] + 1 == nums[i+1] && nums[i+1] + 1 == nums[i+2]);
    }

    ReplyDelete
  9. nuurJuly 17, 2022 at 9:23 PM

    public boolean tripleUp(int[] nums) {

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

    }
    return false;
    }

    ReplyDelete
  10. FransissFebruary 5, 2023 at 9:45 AM

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

    ReplyDelete