Java > Array-2 >tenRun (CodingBat Solution)

Problem:

For each multiple of 10 in the given array, change all the values following it to be that multiple of 10, until encountering another multiple of 10. So {2, 10, 3, 4, 20, 5} yields {2, 10, 10, 10, 20, 20}.

tenRun({2, 10, 3, 4, 20, 5}) → {2, 10, 10, 10, 20, 20}
tenRun({10, 1, 20, 2}) → {10, 10, 20, 20}
tenRun({10, 1, 9, 20}) → {10, 10, 10, 20}


Solution:

public int[] tenRun(int[] nums) {
  for(int i = 0; i < nums.length;i++)
  {
  if ( nums[i] % 10 == 0)
  {
  for (int j = i +1; j < nums.length && !(nums[j] % 10 == 0) ; j++) nums[j] = nums[i];
  }
  }
  return nums;
}


23 comments :

  1. public int[] tenRun(int[] nums) {
    int multiple = -1;
    for(int i = 0; i < nums.length; i++) {
    if(multiple != -1 && nums[i]%10 != 0) nums[i] = multiple;
    if(nums[i]%10 == 0) multiple = nums[i];
    }
    return nums;
    }

    ReplyDelete
  2. public int[] tenRun(int[] nums) {
    int temp = 0;
    boolean ten = false;

    for(int i=0; i<nums.length; i++){
    if(nums[i]%10==0){
    temp = nums[i];
    ten = true;
    continue;
    }
    if(ten & nums[i]%10!=0){
    nums[i] = temp;
    }
    }
    return nums;
    }

    ReplyDelete
  3. public int[] tenRun(int[] nums) {

    for (int i=0; i<nums.length; i++) {
    if (nums[i] % 10 == 0)
    while (i<nums.length-1 && nums[i+1] % 10 != 0) {
    nums[i+1]=nums[i];
    i++;
    }
    }
    return nums;
    }

    ReplyDelete
  4. public int[] tenRun(int[] nums) {
    __for(int i = 0; i < nums.length-1; i++) {
    ___if(nums[i] % 10 == 0) {

    _____if(nums[i+1] % 10 != 0)
    _______nums[i+1] = nums[i];

    ___}
    __}

    __return nums;
    }

    ReplyDelete
  5. public int[] tenRun(int[] nums) {
    int[] arr = new int[nums.length];
    for (int i = 0; i < nums.length; i++) {
    int val = 10;
    if (nums[i] % 10==0) {
    while (i < nums.length) {
    if (nums[i] % 10 == 0) {
    if (val != nums[i]) {
    val = nums[i];
    }
    arr[i] = nums[i];
    i++;
    } else {
    arr[i] = val;
    i++;
    }
    }
    } else
    arr[i] = nums[i];
    }
    return arr;
    }

    ReplyDelete
  6. public int[] tenRun(int[] nums) {
    for (int i = 0; i<nums.length-1; i++) {
    if (nums[i]%10==0&&nums[i+1]%10!=0) {
    nums[i+1]=nums[i];
    } else if(nums[i]%10==0&&nums[i+1]%10==0) {
    nums[i]=nums[i];
    }
    }
    return nums;
    }

    ReplyDelete
  7. public int[] tenRun(int[] nums) {
    for (int i = 0; i<nums.length-1; i++) {
    if (nums[i]%10==0&&nums[i+1]%10!=0) {
    nums[i+1]=nums[i];
    } else if(nums[i]%10==0&&nums[i+1]%10==0) {
    nums[i]=nums[i];
    }
    }
    return nums;
    }

    ReplyDelete
  8. public int[] tenRun(int[] nums) {
    if (nums.length<=1) {return nums;}

    for (int i = 1; i < nums.length; i++) {

    if (nums[i]%10==0) {continue;}

    if (nums[i-1]%10 == 0) {
    nums[i] = nums[i-1];
    }
    }

    return nums;

    }

    ReplyDelete
  9. int ar[]=new int [nums.length];
    int k=-1;
    for(int i =0; i<nums.length; i++) {
    if(nums[i]%10==0) {
    k=nums[i];
    ar[i]=k;
    }
    if(nums[i]%10!=0 && k%10==0){
    ar[i]=k;
    }else if(nums[i]%10!=0 && k%10!=0) {
    ar[i]=nums[i];
    }

    }
    return ar;

    ReplyDelete

  10. int[] a = new int[nums.length];
    int t = -1;

    for(int i = 0; i < nums.length; i++){

    if(nums[i] % 10 == 0 || nums[i] == 0) {

    t = nums[i];

    }

    if (t != -1) {
    a[i] = t;
    } else {
    a[i] = nums[i];
    }

    }

    return a;

    ReplyDelete
  11. public int[] tenRun(int[] nums) {

    int currentMultiple = 7; //bogus number to initialize variable

    for(int i = 0; i < nums.length; i++) {

    if(nums[i] % 10 == 0) {
    currentMultiple = nums[i];
    } else {
    if(currentMultiple != 7) {
    nums[i] = currentMultiple;
    }
    }
    }
    return nums;
    }

    ReplyDelete
  12. public int[] tenRun(int[] nums) {
    for(int i = 0; i < nums.length - 1; i++) {
    if(nums[i] % 10 == 0) {
    while(nums[i+1] % 10 != 0) {
    nums[i+1] = nums[i];
    }
    }
    }
    return nums;
    }

    ReplyDelete
  13. public int[] tenRun(int[] nums) {
    int[] result = new int[nums.length];
    int setter = 0;
    boolean index = false;
    int target = 0;
    for(int i = 0; i < nums.length; i++) {
    if(nums[i] % 10 == 0){
    result[i] = nums[i];
    index = true;
    setter = nums[i];
    }
    if(nums[i] % 10 !=0 && index){
    result[i] = setter;
    } else {
    result[i] = nums[i];
    }
    }
    return result;
    }

    ReplyDelete
  14. public int[] tenRun(int[] nums) {
    for (int i = 0; i < nums.length - 1; i++)
    {
    if (nums[i] % 10 == 0 && nums[i + 1] % 10 != 0)
    {
    nums[i + 1] = nums[i];
    }
    }
    return nums;
    }

    ReplyDelete
  15. public int[] tenRun(int[] nums) {
    for(int i=1;i<nums.length;i++){
    if(nums[i]%10!=0 && nums[i-1]%10==0){
    nums[i]=nums[i-1];
    }
    }
    return nums;
    }

    ReplyDelete
  16. public int[] tenRun(int[] nums) {
    boolean f=false;
    int z=0;
    for(int i=0;i<nums.length-1;i++){
    if(nums[i]%10==0 && nums[i+1]%10!=0){
    i++;
    z=nums[i-1];
    f=true;
    }
    if(f==true){
    nums[i]=z;
    }
    else{
    f=false;
    }
    }
    return nums;
    }

    ReplyDelete
  17. public int[] tenRun(int[] nums) {
    for(int i =0; i<nums.length-1;i++){
    if(nums[i]%10==0&&nums[i+1]%10!=0)
    nums[i+1]=nums[i];
    }
    return nums;
    }

    ReplyDelete
  18. public int[] tenRun(int[] nums) {
    int t=0;
    boolean found=false;
    for(int i=0;i<nums.length;i++){
    if(nums[i]%10==0){
    t=nums[i];
    found=true;
    }
    else if(found==false)
    t=nums[i];

    nums[i]=t;
    }
    return nums;
    }

    ReplyDelete
  19. public int[] tenRun(int[] nums)
    {
    boolean flag = false;
    int last = 0;
    for(int i=0;i<nums.length;i++)
    {
    if(nums[i]%10 == 0)
    {
    flag = true;
    last = nums[i];
    }

    if(flag)
    {
    nums[i] = last;
    }
    }
    return nums;
    }

    ReplyDelete
  20. public int[] tenRun(int[] nums) {
    for(int i=1; i<nums.length;i++) {
    if(nums[i-1]%10==0 && nums[i]%10!=0) {
    nums[i]=nums[i-1];
    }
    }

    return nums;
    }

    ReplyDelete

Follow Me

If you like our content, feel free to follow me to stay updated.

Subscribe

Enter your email address:

We hate spam as much as you do.

Upload Material

Got an exam, project, tutorial video, exercise, solutions, unsolved problem, question, solution manual? We are open to any coding material. Why not upload?

Upload

Copyright © 2012 - 2014 Java Problems  --  About  --  Attribution  --  Privacy Policy  --  Terms of Use  --  Contact