troubleshooting Question

has12 challenge

Avatar of gudii9
gudii9Flag for United States of America asked on
JavaJava EEProgrammingProgramming Languages-OtherProgramming Theory
13 Comments2 Solutions299 ViewsLast Modified:
Hi,

I am working on below challenge
http://codingbat.com/prob/p169260

Psedo code description of approach :
1. loop though given array
2. check where is 1
3. check where is 2
4. if 2place is somewhere further down than by 1 return true
5 else return false
I wrote my code as below
public boolean has12(int[] nums) {
  int onePlace=0;
  int twoPlace=0;
  for(int i=0;i<nums.length;i++){
    if(nums[i]==1){
      onePlace=i;
      
    }
     if(nums[i]==2){
      twoPlace=i;
      
    }
  }
  return (twoPlace>onePlace);
}




I am passing all tests

How to improve my design, approach, code? please advise
ASKER CERTIFIED SOLUTION
phoffricSoftware Engineering and Matlab Analyst

Our community of experts have been thoroughly vetted for their expertise and industry experience.

Join our community to see this answer!
Unlock 2 Answers and 13 Comments.
Start Free Trial
Learn from the best

Network and collaborate with thousands of CTOs, CISOs, and IT Pros rooting for you and your success.

Andrew Hancock - VMware vExpert
See if this solution works for you by signing up for a 7 day free trial.
Unlock 2 Answers and 13 Comments.
Try for 7 days

”The time we save is the biggest benefit of E-E to our team. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange.

-Mike Kapnisakis, Warner Bros