Method dijkstra

MinimumCosttoConvertStringI.java:2–34

(int S, long adj[][])

class Solution {
    long[] dijkstra(int S, long adj[][]){
        long dist[] = new long[26];
        for(int i=0;i<26;i++){
            dist[i] = Integer.MAX_VALUE;
        }
        dist[S] = 0;
        PriorityQueue<long[]> pq = new PriorityQueue<>(new Comparator<long[]>(){
            public int compare(long a[], long b[]){
                if(a[1]<=b[1]){
                    return -1;
                }
                return 1;
            }
        });
        pq.offer(new long[] {S,0});
        
        while(!pq.isEmpty()){
            long element[] = pq.poll();
            long node = element[0];
            long distance = element[1];
            for(int i=0;i<26;i++){
                if(adj[(int)node][i]==Integer.MAX_VALUE){
                    continue;
                }
                long newDist = distance +  adj[(int)node][i]; 
                if(newDist<dist[i]){
                    dist[i] = newDist;
                    pq.offer(new long[]{i,newDist});
                }
            }
        }
        return dist;
    }
    public long minimumCost(String source, String target, char[] original, char[] changed, int[] cost) {
        //adj list for directed graph
        long adj[][] = new long[26][26];