Fixed sonar warnings.

Author: javadev

src/main/java/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time/Solution.java

@@ -12,13 +12,7 @@
 public class Solution {
  public int minCost(int maxTime, int[][] edges, int[] passingFees) {
  final PriorityQueue<Tuple> pq =
- new PriorityQueue<>(
- (a, b) -> {
- if (a.cost != b.cost) {
- return a.cost - b.cost;
- }
- return a.time - b.time;
- });
+ new PriorityQueue<>((a, b) -> a.cost == b.cost ? a.time - b.time : a.cost - b.cost);
  final int n = passingFees.length;
  final int[] minTime = new int[n];
  Arrays.fill(minTime, Integer.MAX_VALUE);
@@ -29,22 +23,18 @@ public int minCost(int maxTime, int[][] edges, int[] passingFees) {
  pq.offer(new Tuple(0, passingFees[0], 0));
  while (!pq.isEmpty()) {
  final Tuple curr = pq.poll();
- if (curr.time > maxTime || curr.time >= minTime[curr.node]) {
- continue;
- }
- minTime[curr.node] = curr.time;
- if (curr.node == n - 1) {
- return curr.cost;
- }
- for (final Edge edge : graph.getEdges(curr.node)) {
- final int time = curr.time + edge.weight;
- if (time > maxTime) {
- continue;
+ if (curr.time <= maxTime && curr.time < minTime[curr.node]) {
+ minTime[curr.node] = curr.time;
+ if (curr.node == n - 1) {
+ return curr.cost;
  }
- if (time >= minTime[edge.dst]) {
- continue;
+ for (final Edge edge : graph.getEdges(curr.node)) {
+ final int time = curr.time + edge.weight;
+ if (time > maxTime || time >= minTime[edge.dst]) {
+ continue;
+ }
+ pq.offer(new Tuple(edge.dst, curr.cost + passingFees[edge.dst], time));
  }
- pq.offer(new Tuple(edge.dst, curr.cost + passingFees[edge.dst], time));
  }
  }
  return -1;
@@ -54,8 +44,8 @@ private static class Graph {
  private final Map<Integer, List<Edge>> edges = new HashMap<>();
 
  private void addEdge(final int src, final int dst, final int weight) {
- this.edges.computeIfAbsent(src, k -> new ArrayList<>()).add(new Edge(src, dst, weight));
- this.edges.computeIfAbsent(dst, k -> new ArrayList<>()).add(new Edge(dst, src, weight));
+ this.edges.computeIfAbsent(src, k -> new ArrayList<>()).add(new Edge(dst, weight));
+ this.edges.computeIfAbsent(dst, k -> new ArrayList<>()).add(new Edge(src, weight));
  }
 
  private List<Edge> getEdges(final int node) {
@@ -64,19 +54,13 @@ private List<Edge> getEdges(final int node) {
  }
 
  private static final class Edge {
- private final int src;
  private final int dst;
  private final int weight;
 
- private Edge(final int src, final int dst, final int weight) {
- this.src = src;
+ private Edge(final int dst, final int weight) {
  this.dst = dst;
  this.weight = weight;
  }
-
- public String toString() {
- return "(" + src + "," + dst + "," + weight + ")";
- }
  }
 
  private static class Tuple {
@@ -89,9 +73,5 @@ private Tuple(final int node, final int cost, final int time) {
  this.cost = cost;
  this.time = time;
  }
-
- public String toString() {
- return "(" + node + "," + cost + "," + time + ")";
- }
  }
 }

src/main/java/g1901_2000/s1929_concatenation_of_array/Solution.java

@@ -5,10 +5,8 @@
 public class Solution {
  public int[] getConcatenation(int[] nums) {
  int[] result = new int[nums.length * 2];
- int i = 0;
- for (; i < nums.length; i++) {
- result[i] = nums[i];
- }
+ System.arraycopy(nums, 0, result, 0, nums.length);
+ int i = nums.length;
  for (int j = 0; i < result.length && j < nums.length; i++, j++) {
  result[i] = nums[j];
  }

src/main/java/g1901_2000/s1936_add_minimum_number_of_rungs/Solution.java

@@ -6,7 +6,8 @@ public class Solution {
  public int addRungs(int[] rungs, int dist) {
  int addons = 0;
  int currentHeight = 0;
- for (int i = 0; i < rungs.length; ) {
+ int i = 0;
+ while (i < rungs.length) {
  int nextRung = rungs[i];
  if (nextRung - currentHeight <= dist) {
  currentHeight = nextRung;