zoukankan      html  css  js  c++  java
  • [leetcode-753-Open the Lock]

    You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely and wrap around: for example we can turn '9' to be '0', or '0' to be '9'. Each move consists of turning one wheel one slot.

    The lock initially starts at '0000', a string representing the state of the 4 wheels.

    You are given a list of deadends dead ends, meaning if the lock displays any of these codes, the wheels of the lock will stop turning and you will be unable to open it.

    Given a target representing the value of the wheels that will unlock the lock, return the minimum total number of turns required to open the lock, or -1 if it is impossible.

    Example 1:

    Input: deadends = ["0201","0101","0102","1212","2002"], target = "0202"
    Output: 6
    Explanation:
    A sequence of valid moves would be "0000" -> "1000" -> "1100" -> "1200" -> "1201" -> "1202" -> "0202".
    Note that a sequence like "0000" -> "0001" -> "0002" -> "0102" -> "0202" would be invalid,
    because the wheels of the lock become stuck after the display becomes the dead end "0102".
    

    Example 2:

    Input: deadends = ["8888"], target = "0009"
    Output: 1
    Explanation:
    We can turn the last wheel in reverse to move from "0000" -> "0009".
    

    Example 3:

    Input: deadends = ["8887","8889","8878","8898","8788","8988","7888","9888"], target = "8888"
    Output: -1
    Explanation:
    We can't reach the target without getting stuck.
    

    Example 4:

    Input: deadends = ["0000"], target = "8888"
    Output: -1
    

    Note:

    1. The length of deadends will be in the range [1, 500].
    2. target will not be in the list deadends.
    3. Every string in deadends and the string target will be a string of 4 digits from the 10,000 possibilities '0000' to '9999'.

    思路:

    BFS广度优先搜索。当前状态到下一个状态有4*2 = 8种可能。并随时记录状态是否访问,剪枝优化。

    int openLock(vector<string>& deadends, string target)
     {
        int ret = 0;
        unordered_set<string> dead(deadends.begin(),deadends.end());
        unordered_set<string> visited;
        queue<string>que;
        if(dead.find("0000")!=dead.end()) return -1;
        visited.insert("0000");
        que.push("0000");
        
        while(!que.empty())
        {
            int sz = que.size();
            for(int i=0;i<sz;i++)
            {
                string temp = que.front();que.pop();
                vector<string>next = getNext(temp);
                for(auto n : next)
                {
                    if(n == target)return ret+1;
                    if(visited.find(n)!=visited.end()) continue;
                    if(dead.find(n)==dead.end())
                    {
                        que.push(n);
                        visited.insert(n);
                    }
                }
            }
            ret++;
        }
        return -1;        
      }
      
      vector<string> getNext(string str)
      {
        vector<string> next;
        for(int i=0;i<4;i++)
        {
            string tmp = str;
            tmp[i] = (str[i]+1-'0')%10+'0';
            next.push_back(tmp);
            tmp[i] = (str[i]-1-'0'+10)%10+'0';
            next.push_back(tmp);
        }
        return next;
      }

    参考:

    https://discuss.leetcode.com/topic/114807/bfs-solution-c

  • 相关阅读:
    node.js JS对象和JSON字符串之间的转换
    read和write函数
    使用stdarg.h实现可变长度参数
    PHP __DIR__, __FILE__, __FUNCTION__, __CLASS__, __METHOD__, __LINE__, __NAMESPACE__
    Yii中 RBAC(基于角色的访问控制权限)表结构原理分析
    让服务器apache/iis/nginx支持.apk/ipa文件下载
    jQuery的maskedinput插件 设置input掩码
    修改XCode的Product的输出目录(有时不生效需看)
    OC的类别(分类)和拓展
    C和C++混合编程中的extern "C" {}
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/8178218.html
Copyright © 2011-2022 走看看