zoukankan      html  css  js  c++  java
  • LC 245. Shortest Word Distance III 【lock, medium】

    Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.

    word1 and word2 may be the same and they represent two individual words in the list.

    Example:
    Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

    Input: word1 = “makes”, word2 = “coding”
    Output: 1
    
    Input: word1 = "makes", word2 = "makes"
    Output: 3
    

    Note:
    You may assume word1 and word2 are both in the list.

    这题虽然可以沿用上一题的思路,但是可以有更简单的两个index的做法,最优解O(n),runtime 8ms。

    class Solution {
    public:
        int shortestWordDistance(vector<string>& words, string word1, string word2) {
            int index = -1;
            int minval = words.size();
            for(int i=0; i<words.size(); i++){
                if((index != -1) && (words[i] == word1 || words[i] == word2)){
                    if((words[index] == word1 && words[i] == word2) || 
                       (words[index] == word2 && words[i] == word1)){
                        minval = min(minval, i - index);
                    }
                }
                if(words[i] == word1 || words[i] == word2)
                    index = i;
            }
            return minval;
        }
    };
  • 相关阅读:
    常见的单链表题目
    一个string类的几个函数
    strcpy和memcpy的区别
    字符串及 strcpy几种写法
    什么函数不能声明为虚函数
    STL中Vector和List的底层数据结构
    C/C++堆、栈及静态数据区详解
    tcp四次握手
    几个知识点
    内存对齐的规则与作用
  • 原文地址:https://www.cnblogs.com/ethanhong/p/10141037.html
Copyright © 2011-2022 走看看