mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
加入新解法:螺旋矩阵定义4个边界
This commit is contained in:
8
.idea/.gitignore
generated
vendored
Normal file
8
.idea/.gitignore
generated
vendored
Normal file
@ -0,0 +1,8 @@
|
||||
# Default ignored files
|
||||
/shelf/
|
||||
/workspace.xml
|
||||
# Editor-based HTTP Client requests
|
||||
/httpRequests/
|
||||
# Datasource local storage ignored files
|
||||
/dataSources/
|
||||
/dataSources.local.xml
|
4
.idea/encodings.xml
generated
Normal file
4
.idea/encodings.xml
generated
Normal file
@ -0,0 +1,4 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="Encoding" addBOMForNewFiles="with NO BOM" />
|
||||
</project>
|
6
.idea/inspectionProfiles/profiles_settings.xml
generated
Normal file
6
.idea/inspectionProfiles/profiles_settings.xml
generated
Normal file
@ -0,0 +1,6 @@
|
||||
<component name="InspectionProjectProfileManager">
|
||||
<settings>
|
||||
<option name="USE_PROJECT_PROFILE" value="false" />
|
||||
<version value="1.0" />
|
||||
</settings>
|
||||
</component>
|
8
.idea/leetcode-master.iml
generated
Normal file
8
.idea/leetcode-master.iml
generated
Normal file
@ -0,0 +1,8 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<module type="PYTHON_MODULE" version="4">
|
||||
<component name="NewModuleRootManager">
|
||||
<content url="file://$MODULE_DIR$" />
|
||||
<orderEntry type="inheritedJdk" />
|
||||
<orderEntry type="sourceFolder" forTests="false" />
|
||||
</component>
|
||||
</module>
|
4
.idea/misc.xml
generated
Normal file
4
.idea/misc.xml
generated
Normal file
@ -0,0 +1,4 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="ProjectRootManager" version="2" project-jdk-name="Python 3.6 (django3)" project-jdk-type="Python SDK" />
|
||||
</project>
|
8
.idea/modules.xml
generated
Normal file
8
.idea/modules.xml
generated
Normal file
@ -0,0 +1,8 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="ProjectModuleManager">
|
||||
<modules>
|
||||
<module fileurl="file://$PROJECT_DIR$/.idea/leetcode-master.iml" filepath="$PROJECT_DIR$/.idea/leetcode-master.iml" />
|
||||
</modules>
|
||||
</component>
|
||||
</project>
|
6
.idea/vcs.xml
generated
Normal file
6
.idea/vcs.xml
generated
Normal file
@ -0,0 +1,6 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="VcsDirectoryMappings">
|
||||
<mapping directory="" vcs="Git" />
|
||||
</component>
|
||||
</project>
|
@ -306,6 +306,47 @@ class Solution(object):
|
||||
return result
|
||||
```
|
||||
|
||||
版本二:定义四个边界
|
||||
```python
|
||||
class Solution(object):
|
||||
def spiralOrder(self, matrix):
|
||||
"""
|
||||
:type matrix: List[List[int]]
|
||||
:rtype: List[int]
|
||||
"""
|
||||
if not matrix:
|
||||
return []
|
||||
|
||||
rows = len(matrix)
|
||||
cols = len(matrix[0])
|
||||
top, bottom, left, right = 0, rows - 1, 0, cols - 1
|
||||
print_list = []
|
||||
|
||||
while top <= bottom and left <= right:
|
||||
# 从左到右
|
||||
for i in range(left, right + 1):
|
||||
print_list.append(matrix[top][i])
|
||||
top += 1
|
||||
|
||||
# 从上到下
|
||||
for i in range(top, bottom + 1):
|
||||
print_list.append(matrix[i][right])
|
||||
right -= 1
|
||||
|
||||
# 从右到左
|
||||
if top <= bottom:
|
||||
for i in range(right, left - 1, -1):
|
||||
print_list.append(matrix[bottom][i])
|
||||
bottom -= 1
|
||||
|
||||
# 从下到上
|
||||
if left <= right:
|
||||
for i in range(bottom, top - 1, -1):
|
||||
print_list.append(matrix[i][left])
|
||||
left += 1
|
||||
|
||||
return print_list
|
||||
```
|
||||
|
||||
|
||||
<p align="center">
|
||||
|
@ -207,6 +207,50 @@ class Solution:
|
||||
return nums
|
||||
```
|
||||
|
||||
版本二:定义四个边界
|
||||
```python
|
||||
class Solution(object):
|
||||
def generateMatrix(self, n):
|
||||
if n <= 0:
|
||||
return []
|
||||
|
||||
# 初始化 n x n 矩阵
|
||||
matrix = [[0]*n for _ in range(n)]
|
||||
|
||||
# 初始化边界和起始值
|
||||
top, bottom, left, right = 0, n-1, 0, n-1
|
||||
num = 1
|
||||
|
||||
while top <= bottom and left <= right:
|
||||
# 从左到右填充上边界
|
||||
for i in range(left, right + 1):
|
||||
matrix[top][i] = num
|
||||
num += 1
|
||||
top += 1
|
||||
|
||||
# 从上到下填充右边界
|
||||
for i in range(top, bottom + 1):
|
||||
matrix[i][right] = num
|
||||
num += 1
|
||||
right -= 1
|
||||
|
||||
# 从右到左填充下边界
|
||||
|
||||
for i in range(right, left - 1, -1):
|
||||
matrix[bottom][i] = num
|
||||
num += 1
|
||||
bottom -= 1
|
||||
|
||||
# 从下到上填充左边界
|
||||
|
||||
for i in range(bottom, top - 1, -1):
|
||||
matrix[i][left] = num
|
||||
num += 1
|
||||
left += 1
|
||||
|
||||
return matrix
|
||||
```
|
||||
|
||||
### JavaScript:
|
||||
|
||||
```javascript
|
||||
|
Reference in New Issue
Block a user