- 浏览: 136977 次
文章分类
- 全部博客 (189)
- Tree (14)
- Dynamic Programming (34)
- Array (20)
- Search (1)
- Hash (12)
- Backtracking (22)
- Divide and Conque (8)
- Greedy (6)
- Stack (12)
- software (0)
- List (7)
- Math (22)
- Two pointers (16)
- String (20)
- Linux (1)
- Sliding Window (4)
- Finite State Machine (1)
- Breadth-first Search (7)
- Graph (4)
- DFS (6)
- BFS (3)
- Sort (9)
- 基础概念 (2)
- 沟通表达 (0)
- Heap (2)
- Binary Search (15)
- 小结 (1)
- Bit Manipulation (8)
- Union Find (4)
- Topological Sort (1)
- PriorityQueue (1)
- Design Pattern (1)
- Design (1)
- Iterator (1)
- Queue (1)
最新评论
-
likesky3:
看了数据结构书得知并不是迭代和递归的区别,yb君的写法的效果是 ...
Leetcode - Graph Valid Tree -
likesky3:
迭代和递归的区别吧~
Leetcode - Graph Valid Tree -
qb_2008:
还有一种find写法:int find(int p) { i ...
Leetcode - Graph Valid Tree -
qb_2008:
要看懂这些技巧的代码确实比较困难。我是这么看懂的:1. 明白这 ...
Leetcode - Single Num II -
qb_2008:
public int singleNumber2(int[] ...
Leetcode - Single Num II
This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2.
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.
For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
Given word1 = “makes”, word2 = “coding”, return 1.
Given word1 = "makes", word2 = "makes", return 3.
Note:
You may assume word1 and word2 are both in the list.
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.
For example,
Assume that words = ["practice", "makes", "perfect", "coding", "makes"].
Given word1 = “makes”, word2 = “coding”, return 1.
Given word1 = "makes", word2 = "makes", return 3.
Note:
You may assume word1 and word2 are both in the list.
public class Solution { // Method 1 public int shortestWordDistance1(String[] words, String word1, String word2) { if (words == null) return -1; if (word1.equals(word2)) return shortestWordDistanceCaseSame(words, word1); int idx1 = -1, idx2 = -1; int diff = words.length; for (int i = 0; i < words.length; i++) { if (words[i].equals(word1)) { idx1 = i; if (idx2 != -1) { diff = Math.min(diff, idx1 - idx2); } } else if (words[i].equals(word2)) { idx2 = i; if (idx1 != -1) { diff = Math.min(diff, idx2 - idx1); } } } return diff; } public int shortestWordDistanceCaseSame(String[] words, String word) { int prev = -1, curr = -1; int diff = words.length; for (int i = 0; i < words.length; i++) { if (words[i].equals(word)) { curr = i; if (prev != -1) diff = Math.min(curr - prev, diff); prev = curr; } } return diff; } // Method 2: all in one method public int shortestWordDistance(String[] words, String word1, String word2) { if (words == null) return -1; int idx1 = -1, idx2 = -1; int diff = words.length; for (int i = 0; i < words.length; i++) { if (words[i].equals(word1)) { if (word1.equals(word2)) { if (idx1 != -1) diff = Math.min(diff, i - idx1); idx1 = i; } else { idx1 = i; if (idx2 != -1) { diff = Math.min(diff, idx1 - idx2); } } } else if (words[i].equals(word2)) { idx2 = i; if (idx1 != -1) { diff = Math.min(diff, idx2 - idx1); } } } return diff; } }
发表评论
-
Leetcode - H-Index
2015-09-06 09:08 1118Given an array of citations (ea ... -
Leetcode - Add Binary
2015-08-21 09:28 467[分析] 从低位往高位逐位相加,就是这么一个简单的题却花了我一 ... -
Leetcode - Longest Consecutive Sequence
2015-08-20 21:20 485[分析] base version说几句: 数组题一定要考虑重 ... -
Leetcode - First Missing Positive
2015-08-20 07:45 652[分析] 将各个正数放入相应下标处,使之满足nums[nums ... -
Leetcode - Set Matrix Zeros
2015-08-19 20:55 548Given a m x n matrix, if an ele ... -
Leetcode - Rotate Image
2015-08-19 19:51 497[分析] 自己的思路:从外到内一圈圈顺时针旋转90度,坐标映射 ... -
Missing Ranges
2015-08-19 09:48 513[分析] 此题若不考虑极大值极小值相关的corner case ... -
Leetcode - 3Sum Smaller
2015-08-18 22:12 1484Given an array of n integers nu ... -
Leetcode - Spiral Matrix II
2015-08-18 19:49 495Given an integer n, generate a ... -
Leetcode - Spiral Matrix
2015-08-18 09:50 425Given a matrix of m x n element ... -
Leetcode - Contains Duplicate II
2015-08-18 07:57 556Given an array of integers and ... -
Leetcode - Shortest Word Distance II
2015-08-18 07:25 1359This is a follow up of Shortest ... -
Leetcode - Shortest Word Distance
2015-08-17 22:01 917Given a list of words and two w ... -
Leetcode - Insert Interval
2015-08-14 10:12 626[分析] 这道题思路直接,但bug free需要费些心力。第一 ... -
Leetcode - Valid Sudoku
2015-07-30 21:57 471Determine if a Sudoku is valid, ... -
Leetcode -Rotate Array
2015-07-21 08:16 541Rotate an array of n elements t ... -
Leetcode - House Robber II
2015-05-20 22:34 767Note: This is an extension of ... -
Leetcode - Largest Rectangle in Histogram
2015-05-20 07:53 491Given n non-negative integers ... -
MockInterview-IPRangeData Find&Insert
2015-04-12 08:09 0[题目] Finding the IP address w ... -
Leetcode - MissingRange
2015-03-31 09:25 449Given a sorted integer array ...
相关推荐
LeetCode,作为全球知名的在线编程挑战平台,为学习和实践算法提供了丰富的资源,其上的“leetcode-spider”项目则为程序员提供了一个自动爬取和练习LeetCode算法题目的工具。 一、算法概述 算法,简单来说,就是...
《在IDE中高效进行LeetCode练习:leetcode-editor的深度解析》 在编程学习与技能提升的过程中,LeetCode作为一款广受欢迎的在线编程挑战平台,帮助众多开发者锻炼算法思维,提高编程能力。而为了进一步提升练习体验...
leetcode-习题集资源leetcode-习题集资源leetcode-习题集资源leetcode-习题集资源leetcode-习题集资源leetcode-习题集资源
leetcode-cli-plugins leetcode-cli 的第 3 方插件。 什么是 如何使用 如何使用 插件 名称 描述 增强的命令 按公司或标签过滤问题 list 不要在同一台计算机上使 Chrome 的会话过期 login 不要在同一台计算机上使 ...
在IDE中解决LeetCode问题,支持leetcode.com与leetcode-cn.com,满足基本的做题需求。 理论上支持: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio。
LeetCode Editor 7.4 版本的下载是一个名为 "leetcode-editor" 的压缩包文件。这个压缩包的导入过程非常简单,只需要将它直接拖入 IDEA 界面,IDEA 会自动识别并安装插件。这种方式使得安装过程无需额外的步骤,对于...
leetcode-习题集资源源代码leetcode-习题集资源源代码leetcode-习题集资源源代码leetcode-习题集资源源代码leetcode-习题集资源源代码
~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/vsc-leetcode-cli/bin/leetcode /usr/local/bin/leetcode 修改模板 open ~/.vscode/extensions/leetcode.vscode-leetcode-0.17.0/node_modules/...
解题思路思路和LeetCode-python 503.下一个更大元素 II一致,只是这里求的是下标的距离,而不是数值倒序搜索,用到栈,栈里存储索引情况1:若栈为
《PyPI官网下载 | leetcode-export-1.1.tar.gz》 在编程世界里,LeetCode是一个备受程序员喜爱的在线平台,它提供了大量的算法题目,帮助开发者提升编程技能和解决问题的能力。而Python作为一门广泛使用的高级编程...
leetcode-cheat 的发布 它是什么 ? 这是一个chrome 扩展,可以帮助您更高效地使用 leetcode。您可以从 重要: leetcode-cheat 现在只支持中文版。 也就是说不完全支持leetcode.com,但是你可以用leetcode-cn.com代替...
`swift-Swif-LeetCode-Utils` 是一个实用工具库,它为Swift程序员提供了方便快捷的方法来处理这些问题。这个项目可以帮助你更高效地进行LeetCode上的编程练习,提升你的解决方案的可读性和简洁性。 首先,让我们...
java java_leetcode-115-distinct-subsquences
java java_leetcode-112-path-sum
java java_leetcode-101-symmetric-tree
java java_leetcode-100-same-tree
java java_leetcode-110-balanced-binary-tree
java java_leetcode-73-set-matrix-zeroes
970. 强整数对数运算function powerfulIntegers(x: number, y: number, bound: number): numb