vamsu
8/18/2018 - 7:45 PM

Practice recursion.. is odd parity

Practice recursion.. is odd parity

import java.io.*;
import java.util.*;



class Solution {
  public static void main(String[] args) {
   Solution solution = new Solution();
    int[][] input = {
      {1,1,1,1},
      {0,0,0,1},
      {0,0,0}
    };
    
    for(int i=0; i< input.length; i++){
       System.out.println("Input :" + Arrays.toString(input[i]) + ", Result:" + solution.isOddParity(input[i], input[i].length));
      System.out.println("Input :" + Arrays.toString(input[i]) + ", Result:" + solution.isOddParityR(input[i], input[i].length));
    }
  }
  
  public boolean isOddParityR(int[] input, int size) {
    if(size == 0){
      return false; 
    }
    boolean oddParity = isOddParity(input, size-1);
    if(input[size-1] == 1){
       oddParity = !oddParity;
    }
    return oddParity;
  }
  
  public boolean isOddParity(int[] input, int size){
    boolean oddParity = false;
    for(int i=0;i<size;i++){
      if(input[i] == 1) {
        oddParity = !oddParity;
      }
    }
    return oddParity;
  }
}