issues Search Results · repo:wind-liang/leetcode language:Shell
Filter by
8 results
(61 ms)8 results
inwind-liang/leetcode (press backspace or delete to remove)第5题解法五的下面这两个链接失效: http://ju.outofmemory.cn/entry/130005
https://articles.leetcode.com/longest-palindromic-substring-part-ii/
我找到了第二个链接的archive:
https://web.archive.org/web/20190420104610/http://articles.leetcode.com/longest-palindromic-substring-part-ii/ ...
zhang1pr
- Opened on Jul 16, 2020
- #9
/* 链表反序存储时,是不是可以使用堆栈? */
type stack []int
func (s *stack) push(item int) {
(*s) = append((*s), item)
}
func (s *stack) pop() int {
item := (*s)[len(*s)-1]
(*s) = (*s)[:len(*s)-1]
return item
}
...
cocoklp
- 1
- Opened on Jun 18, 2020
- #8
https://github.com/wind-liang/leetcode/blob/master/leetCode-5-Longest-Palindromic-Substring.md 通常 i 是行 j 是列。
你在图中倒过来不适应。Thanks
robinqhuang
- 1
- Opened on May 21, 2019
- #2
这篇文章
此时 3 位置的数值对应为数组下标是 0 的值,1 位置的值对应数组下标是 5 的值。任意位置的对应规则是什么呢?0 - 4, 1 - 5,4 - 1,就是就是 (位置 + 偏移 % 数组的长度)。这里就是加上 4 模 7。
其中,(位置 + 偏移 % 数组的长度)应该改成(位置 + 偏移)% 数组的长度
tonyz0x0
- 1
- Opened on Mar 15, 2019
- #1

Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Restrict your search to the title by using the in:title qualifier.
Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Press the /
key to activate the search input again and adjust your query.