Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit efbdfeb

Browse files
update readme
1 parent 1f98dfb commit efbdfeb

File tree

3 files changed

+6
-3
lines changed

3 files changed

+6
-3
lines changed

‎README.md‎

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,8 +5,11 @@ LeetCode
55

66
| # | Title | Solution| Difficulty|
77
|---| ----- | -------- | -------- |
8+
|1550|[Three Consecutive Odds](https://leetcode-cn.com/problems/three-consecutive-odds/) | [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/1550-solution.go) | Easy
89
|876|[Middle of the Linked List](https://leetcode-cn.com/problems/middle-of-the-linked-list/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution876.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution876.rb) | Easy
10+
|766|[Toeplitz Matrix](https://leetcode-cn.com/problems/toeplitz-matrix/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution766.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/766-solution.go) | Easy
911
|674|[Longest Continuous Increasing Subsequence](https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution674.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/674-solution.go) | Easy
12+
|665|[Non-decreasing Array](https://leetcode-cn.com/problems/non-decreasing-array//) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution665.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/665-solution.go) | Easy
1013
|643|[Maximum Average Subarray I](https://leetcode-cn.com/problems/maximum-average-subarray-i/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution643.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/643-solution.go) | Easy
1114
|628|[Maximum Product of Three Numbers](https://leetcode-cn.com/problems/maximum-product-of-three-numbers/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution628.java), [Ruby](https://github.com/xiao2shiqi/leetcode/blob/master/ruby/solution628.rb) | Easy
1215
|566|[Reshape the Matrix](https://leetcode-cn.com/problems/reshape-the-matrix/) | [Java](https://github.com/xiao2shiqi/leetcode/blob/master/src/main/java/Solution566.java), [Go](https://github.com/xiao2shiqi/leetcode/blob/master/go/566-solution.go) | Easy

‎go/1550-solution.go‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -3,10 +3,10 @@ package main
33
import "fmt"
44

55
/**
6-
* LC#1550:https://leetcode-cn.com/problems/three-consecutive-odds/
6+
* LC#1550: Three Consecutive Odds
7+
* Link:https://leetcode-cn.com/problems/three-consecutive-odds/
78
* 思路:送分题,用一个计数器统计就行了,没什么思路。。
8-
*
9-
**/
9+
**/
1010
func threeConsecutiveOdds(arr []int) bool {
1111
if len(arr) == 0 {
1212
return false
File renamed without changes.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /