fix code smells

src/main/java/g0401_0500/s0500_keyboard_row/Solution.java

@@ -8,7 +8,9 @@
 public class Solution {
  private boolean check(String str, String word) {
  for (char ch : word.toCharArray()) {
- if (str.indexOf(ch) < 0) return false;
+ if (str.indexOf(ch) < 0) {
+ return false;
+ }
  }
  return true;
  }

src/main/java/g0501_0600/s0502_ipo/Solution.java

@@ -2,22 +2,16 @@
 
 // #Hard #Array #Sorting #Greedy #Heap_Priority_Queue
 
+import java.util.Comparator;
 import java.util.PriorityQueue;
 
 public class Solution {
- public int findMaximizedCapital(int k, int W, int[] profits, int[] capital) {
+ public int findMaximizedCapital(int k, int w, int[] profits, int[] capital) {
  PriorityQueue<int[]> minCapital =
- new PriorityQueue<>(
- (int[] a, int[] b) -> {
- return a[1] - b[1];
- });
- PriorityQueue<int[]> maxProfit =
- new PriorityQueue<>(
- (int[] a, int[] b) -> {
- return b[0] - a[0];
- });
+ new PriorityQueue<>(Comparator.comparingInt((int[] a) -> a[1]));
+ PriorityQueue<int[]> maxProfit = new PriorityQueue<>((int[] a, int[] b) -> b[0] - a[0]);
  for (int i = 0; i < profits.length; i++) {
- if (W >= capital[i]) {
+ if (w >= capital[i]) {
  maxProfit.offer(new int[] {profits[i], capital[i]});
  } else {
  minCapital.offer(new int[] {profits[i], capital[i]});
@@ -26,12 +20,12 @@ public int findMaximizedCapital(int k, int W, int[] profits, int[] capital) {
  int count = 0;
  while (count < k && !maxProfit.isEmpty()) {
  int[] temp = maxProfit.poll();
- W += temp[0];
+ w += temp[0];
  count += 1;
- while (!minCapital.isEmpty() && minCapital.peek()[1] <= W) {
+ while (!minCapital.isEmpty() && minCapital.peek()[1] <= w) {
  maxProfit.offer(minCapital.poll());
  }
  }
- return W;
+ return w;
  }
 }

src/main/java/g0501_0600/s0503_next_greater_element_ii/Solution.java

@@ -2,13 +2,14 @@
 
 // #Medium #Array #Stack #Monotonic_Stack
 
-import java.util.Stack;
+import java.util.ArrayDeque;
+import java.util.Deque;
 
 public class Solution {
  // credit: https://leetcode.com/articles/next-greater-element-ii/
  public int[] nextGreaterElements(int[] nums) {
  int[] result = new int[nums.length];
- Stack<Integer> stack = new Stack<>();
+ Deque<Integer> stack = new ArrayDeque<>();
  for (int i = nums.length * 2 - 1; i >= 0; i--) {
  while (!stack.isEmpty() && nums[stack.peek()] <= nums[i % nums.length]) {
  stack.pop();