LeetCode 243. Shortest Word Distance (最短单词距离)$
Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list.
For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"]
.
Given word1 = “coding”
, word2 = “practice”
, return 3.
Given word1 = "makes"
, word2 = "coding"
, return 1.
Note:
You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.
题目标签:Array
题目给了我们一个words array, word1 和word2, 让我们找出word1 和word2 之间最短的距离。words array 里的word 可以重复出现。
基本思想是:当找到任何一个word 的时候,记录它的 index, 当两个word 都确定被找到的时候,用它们的index 相减来记录它们之间的距离
Java Solution:
Runtime beats 52.07%
完成日期:04/27/2017
关键词:Array
关键点:当找到任何一个word 时候,记录它的index;只有当两个word 都被找到的情况下,记录它们的距离
public class Solution
{
public int shortestDistance(String[] words, String word1, String word2)
{
int p1 = -1, p2 = -1, min = Integer.MAX_VALUE; for(int i=0; i<words.length; i++)
{
if(words[i].equals(word1)) // if find word1, mark its position
p1 = i;
else if(words[i].equals(word2)) // if find word2, mark its position
p2 = i; if(p1 != -1 && p2 != -1) // if find word1 and word2, save the smaller distance
min = Math.min(min, Math.abs(p1 - p2));
} return min;
}
}
参考资料:
https://discuss.leetcode.com/topic/20668/ac-java-clean-solution
LeetCode 算法题目列表 - LeetCode Algorithms Questions List
最新文章
- 服务器内存UDIMM与RDIMM区别
- 深入理解python的yield和generator
- Java中Comparable和Comparator实现对象比较
- Codeforces Round #181 (Div. 2) B. Coach 带权并查集
- Careercup - Facebook面试题 - 5188884744896512
- cas sso单点登录系列8_抛弃Https让Cas以Http协议提供单点登录服务
- Android开发 解决AlertDialog中的EditText无法调出输入法的问题
- WPF中的CheckBox的_ (underscore / 下划线)丢失
- OVS - commands
- centos7下部署Django(nginx+uwsgi+python3+django)
- mysql下如何删除本节点下的所有子节点小记
- nodejs-5.1 ejs模板引擎
- python简单制作GIF
- 爬了招聘网站之后,总结Python学习的几点建议
- Spring Boot用Cxf的jax-ws开发WebService
- thymeleaf使用基础教程
- Kafka:架构简介【转】
- ambassador 学习二 认证
- 获取当前的window 以及设置其rootViewController
- rocketmq双主发送消息 SLAVE_NOT_AVAILABLE 状态