LeetCode/Java/16.java at master · strengthen/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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
__________________________________________________________________________________________________
2ms
class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int cp, lp, rp, mp;
        int minDiff = nums[0] + nums[1] + nums[nums.length - 1] - target;
        int lmDiff = minDiff, rmDiff = minDiff, diff = minDiff;
        int indicator = 0;

        Arrays.sort(nums);

        for (cp = 0; cp < nums.length && minDiff != 0; cp++) {
            // narrow the range of (lp, rp) bi-directionly
            lp = cp + 1;
            rp = nums.length - 1;
            mp = (lp + rp) / 2;
            while (lp < rp - 1) {

                lmDiff = nums[lp] + nums[mp] + nums[cp] - target;
                rmDiff = nums[rp] + nums[mp] + nums[cp] - target;

                if (lmDiff == 0 || rmDiff == 0) {
                    return target;
                }
                else if (lmDiff > 0) {
                    rp = mp;
                    mp = (lp + rp) / 2;
                    indicator = 1;
                }
                else if (rmDiff < 0) {
                    lp = mp;
                    mp = (lp + rp) / 2;
                    indicator = -1;
                }
                else if (lmDiff < 0 && rmDiff > 0) {
                    indicator = 0;
                    break;
                }
            }

            if (indicator == 0) {
                while (lp < rp) {
                    diff = nums[lp] + nums[rp] + nums[cp] - target;
                    if (diff == 0) {
                        return target;
                    }
                    else if (diff > 0) {
                        if (Math.abs(minDiff) > diff)
                            minDiff = diff;
                        rp--;
                    }
                    else if (diff < 0) {
                        if (Math.abs(minDiff) > -diff)
                            minDiff = diff;
                        lp++;
                    }
                }
            }
            else if (rp > lp) {
                diff = nums[cp] + nums[lp] + nums[rp] - target;
                if (diff > 0) {
                    if (Math.abs(minDiff) > diff)
                        minDiff = diff;
                }
                if (diff < 0) {
                    if (Math.abs(minDiff) > -diff)
                        minDiff = diff;
                }
            }
        }
        return minDiff + target;
    }
}
__________________________________________________________________________________________________
2ms
public class Solution {
    int ans=Integer.MIN_VALUE;
    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        int length=nums.length;
        for (int i = 0; i < length-2; i++) {
            if (i==0||nums[i]!=nums[i-1]) {
                f(nums,i,i+1,length-1,target);
                if (ans==0) {
                    return target;
                }
            }
        }
        return target+ans;
    }
    public void f(int[] nums,int s,int m,int e,int target){
        while (m<e) {
            int res=nums[s]+nums[m]+nums[e]-target;
            if (res==0) {
                ans=0;
                break;
            }else if(res<0) {
                m++;
            }else {
                e--;
            }
            if (ans/res!=0) {
                ans=res;
            }
        }
    };
}
__________________________________________________________________________________________________
3ms
class Solution {
    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        int ans = Integer.MAX_VALUE;
        int ret = ans;
        for(int i = 0; i <= nums.length - 3; i++)
        {
            int left = i + 1, right = nums.length - 1;
            while(left < right)
            {
                int sum = nums[i] + nums[left] + nums[right];
                int diff = sum > target ? sum - target : target - sum;
                if(diff < ans)
                {
                    ans = diff;
                    ret = sum;
                }

                if(sum < target)
                {
                    left++;
                }else if(sum > target)
                {
                    right--;
                }else {
                    return sum;
                }
            }
        }

        return ret;
    }
}
__________________________________________________________________________________________________
34936 kb
class Solution {
    public int threeSumClosest(int[] nums, int target) {
        if(nums==null || nums.length<3) return 0;
        Arrays.sort(nums);
        int len = nums.length;
        int result = nums[0]+nums[1]+nums[len-1];
        for(int i=0; i<len-2; i++){
            int val1 = nums[i];
            int j=i+1;
            int k=len-1;
            while(j<k){
                int sum = val1+nums[j]+nums[k];
                if(sum >target){
                    k--;
                }else
                    j++;
                if(Math.abs(target-result) > Math.abs(target-sum)){
                    result = sum;
                }

            }

        }
        return result;
    }
}
__________________________________________________________________________________________________
34980 kb
class Solution {
    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        int sum=nums[0]+nums[1]+nums[2];
        for(int i=0;i<nums.length-2;i++){
            int j=i+1,k=nums.length-1;
            while(j<k){
                int temp=nums[i]+nums[j]+nums[k];
                if(temp==target){
                    return target;
                }else if(temp>target){
                    k--;
                    if(Math.abs(temp-target)<Math.abs(sum-target))
                        sum=temp;
                }else{
                    j++;
                    if(Math.abs(temp-target)<Math.abs(sum-target))
                        sum=temp;
                }
            }
        }
        return sum;
    }
}
__________________________________________________________________________________________________