博乐科技周赛T3:2059. 转化数字的最小运算数

解题思路

BFS解决

代码

class Solution {
     public int minimumOperations(int[] nums, int start, int goal) {
        Set<Integer> set = new HashSet<>();
        LinkedList<Integer> queue = new LinkedList<>();
        queue.add(start);
        int step = 0;
        while(!queue.isEmpty()){
            int n = queue.size();
            for (int j=0;j<n;j++){
                int cur = queue.getFirst();
                if (cur == goal){
                    return step;
                }
                queue.removeFirst();
                for (int i=0;i<nums.length;i++){
                    int t1 = cur+nums[i];
                    int t2 = cur-nums[i];
                    int t3 = cur^nums[i];
                    if (t1>1000 || t1<0){
                        if (t1==goal){//已经满足
                            return step+1;
                        }
                    }else {
                        if (!set.contains(t1)){
                            set.add(t1);
                            queue.add(t1);
                        }
                    }
                    if (t2>1000 || t2<0){
                        if (t2==goal){
                            return step+1;
                        }
                    }else {
                        if (!set.contains(t2)){
                            set.add(t2);
                            queue.add(t2);
                        }
                    }
                    if (t3>1000 || t3<0){
                        if (t3==goal){
                            return step+1;
                        }
                    }else {
                        if (!set.contains(t3)){
                            set.add(t3);
                            queue.add(t3);
                        }
                    }
                }
            }
            step++;
        }
        return -1;
    }
}