LeetCode Weekly Contest 480 Discussion and Solution
Priyanshu Chaurasiya
2 months ago
Priyanshu Chaurasiya
2 months ago

| Problem | Difficulty |
|---|
Join the conversation by signing in below!
| Points |
|---|
| Status |
|---|
| 1 | Easy | 3 | Solved |
| 2 | Medium | 4 | Solved |
| 3 | Medium | 5 | Unsolved |
| 4 | Hard | 6 | Attempted |
class Solution {
public int absDifference(int[] nums, int k) {
Arrays.sort(nums);
int n = nums.length;
int max = 0;
int min = 0;
for(int i = 0; i < k; i++){
min += nums[i];
}
for(int i = n - 1; i >= n - k; i--){
max += nums[i];
}
return Math.abs(max - min);
}
}class Solution {
public String reverseWords(String s) {
int n = s.length();
StringBuilder ans = new StringBuilder();
int count = 0;
int i = 0;
while(i < n && s.charAt(i) != ' '){
char ch = s.charAt(i);
if(ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u'){
count++;
}
ans.append(ch);
i++;
}
if(i < n && s.charAt(i) == ' ') ans.append(' ');
i++;
while(i < n){
StringBuilder sb = new StringBuilder();
int vowels = 0;
int j = i;
while(j < n && s.charAt(j) != ' '){
char ch = s.charAt(j);
if(ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u'){
vowels++;
}
sb.append(ch);
j++;
}
if(vowels == count){
for(int k = sb.length() - 1; k >= 0; k--){
char ch = sb.charAt(k);
ans.append(ch);
}
}
else{
for(int k = 0; k < sb.length(); k++){
char ch = sb.charAt(k);
ans.append(ch);
}
}
if(j < n && s.charAt(j) == ' ') ans.append(' ');
j++;
i = j;
}
return ans.toString();
}
}No comments yet, Start the conversation!