(Easy) Last Stone Weight LeetCode

class Solution {
    public int lastStoneWeight(int[] stones) {
        
        int len = stones.length;
        int i = len -1;
        int minus = 0;
        int remain = len;
        
       if(stones.length ==1){
           
           return stones[0];
       } 
        
        else {
            
            Arrays.sort(stones);
            
          do{
                if(stones[i]==stones[i-1]){
                    
                    
                    stones[i]   = 0;
                    stones[i-1] = 0;
                    
                    remain = remain -2;
                }
                
                else{
                    
                    stones[i-1]= stones[i]-stones[i-1];
                    stones[i]=0;
                    
                   remain = remain -1;
                }
                   
                
                Arrays.sort(stones);
                
            
          }
          while(remain >1);  
            
            return stones[len-1];
        }
        
    }
}

 

posted @ 2019-07-31 17:55  CodingYM  阅读(101)  评论(0)    收藏  举报