leetCode/leetCode_1395.java at master · mehtabgill/leetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
// class Solution {
//     int result = 0;
//     public int numTeams(int[] rating) {
//         backTrack(new ArrayList<Integer>(), 0, rating);
//         return result;
//     }

//     void backTrack(List<Integer> ll, int start, int[] rating){
//         if(ll.size() == 3){
//             if( ((ll.get(0) > ll.get(1)) && (ll.get(1)> ll.get(2))) || ((ll.get(2) > ll.get(1)) && (ll.get(1)> ll.get(0)))   ){
//                 result++;
//             }
//             return ;
//         }


//         for(int i=start; i<rating.length;i++){
//             ll.add(rating[i]);
//             backTrack(ll, i+1, rating);
//             ll.remove(ll.size()-1);
//         }
//     }
// }

class Solution {

    public int numTeams(int[] rating) {

        int left_s=0, right_s=0, left_b=0, right_b=0, result=0;
        for(int i=0; i < rating.length; i++){
            for(int j=0; j <i; j++){
                if(rating[j] > rating[i]) left_b++;
                if(rating[j] < rating[i]) left_s++;
            }
            for(int k=i+1; k < rating.length; k++){
                if(rating[k] > rating[i]) right_b++;
                if(rating[k] < rating[i]) right_s++;
            }

            result += left_s*right_b + left_b*right_s;
            left_s=0;left_b=0;right_s=0;right_b=0;
        }
        return result;
    }
}