Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: update solutions to lc problem: No.2326 #2787

Merged
merged 1 commit into from
May 10, 2024
Merged

feat: update solutions to lc problem: No.2326 #2787

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
feat: update solutions to lc problem: No.2326
  • Loading branch information
@yanglbme
yanglbme committed May 10, 2024
commit f12fbf39132e80e4720b459e964904844bf39d4c
4 changes: 2 additions & 2 deletions lcci/16.26.Calculator/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -207,7 +207,7 @@ class Solution {
var sign: Character = "+"
var stk = [Int]()
let sArray = Array(s)

for i in 0..<n {
let c = sArray[i]
if c.isNumber {
Expand All @@ -234,7 +234,7 @@ class Solution {
sign = c
}
}

return stk.reduce(0, +)
}
}
Expand Down
4 changes: 2 additions & 2 deletions lcci/16.26.Calculator/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -217,7 +217,7 @@ class Solution {
var sign: Character = "+"
var stk = [Int]()
let sArray = Array(s)

for i in 0..<n {
let c = sArray[i]
if c.isNumber {
Expand All @@ -244,7 +244,7 @@ class Solution {
sign = c
}
}

return stk.reduce(0, +)
}
}
Expand Down
4 changes: 2 additions & 2 deletions lcci/17.01.Add Without Plus/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -50,14 +50,14 @@ class Solution {
var b = b
var sum = 0
var carry = 0

while b != 0 {
sum = a ^ b
carry = (a & b) << 1
a = sum
b = carry
}

return a
}
}
Expand Down
4 changes: 2 additions & 2 deletions lcci/17.01.Add Without Plus/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -51,14 +51,14 @@ class Solution {
var b = b
var sum = 0
var carry = 0

while b != 0 {
sum = a ^ b
carry = (a & b) << 1
a = sum
b = carry
}

return a
}
}
Expand Down
4 changes: 2 additions & 2 deletions lcci/17.05.Find Longest Subarray/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -163,7 +163,7 @@ class Solution {
func findLongestSubarray(_ array: [String]) -> [String] {
var vis: [Int: Int] = [0: -1]
var s = 0, mx = 0, k = 0

for i in 0..<array.count {
s += array[i].first!.isLetter ? 1 : -1
if let j = vis[s] {
Expand All @@ -175,7 +175,7 @@ class Solution {
vis[s] = i
}
}

return Array(array[k..<(k + mx)])
}
}
Expand Down
4 changes: 2 additions & 2 deletions lcci/17.05.Find Longest Subarray/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -172,7 +172,7 @@ class Solution {
func findLongestSubarray(_ array: [String]) -> [String] {
var vis: [Int: Int] = [0: -1]
var s = 0, mx = 0, k = 0

for i in 0..<array.count {
s += array[i].first!.isLetter ? 1 : -1
if let j = vis[s] {
Expand All @@ -184,7 +184,7 @@ class Solution {
vis[s] = i
}
}

return Array(array[k..<(k + mx)])
}
}
Expand Down
100 changes: 53 additions & 47 deletions solution/2300-2399/2326.Spiral Matrix IV/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -46,7 +46,17 @@

## 解法

### 方法一
### 方法一：模拟

我们定义一个二维数组 $\text{ans}$，用来存放链表中的元素，初始时全部填充为 $-1$。定义三个变量 $i, j, k$，分别表示当前的行、列和方向。定义一个数组 $\text{dirs}$，表示四个方向的偏移量。

然后我们开始遍历链表，每次遍历一个节点，就将当前节点的值填充到 $\text{ans}[i][j]$ 中，然后更新链表的指针，如果链表为空，说明所有的元素都已经填充完毕，退出循环。

否则，我们需要找到下一个元素的位置，我们可以通过当前位置 $(i, j)$ 和当前方向 $k$ 来计算下一个位置 $(x, y)$，如果 $(x, y)$ 在矩阵的范围内，并且 $\text{ans}[x][y]$ 为 $-1$，说明 $(x, y)$ 还没有被填充过，我们就将 $(x, y)$ 作为下一个位置，否则我们需要更换方向。

遍历完链表之后，我们就得到了一个螺旋矩阵，返回即可。

时间复杂度 $O(m \times n)$，空间复杂度 $O(m \times n)$。其中 $m$ 和 $n$ 分别表示矩阵的行数和列数。

<!-- tabs:start -->

Expand All @@ -59,20 +69,19 @@
class Solution:
def spiralMatrix(self, m: int, n: int, head: Optional[ListNode]) -> List[List[int]]:
ans = [[-1] * n for _ in range(m)]
i = j = p = 0
dirs = [[0, 1], [1, 0], [0, -1], [-1, 0]]
i = j = k = 0
dirs = (0, 1, 0, -1, 0)
while 1:
ans[i][j] = head.val
head = head.next
if not head:
if head is None:
break
while 1:
x, y = i + dirs[p][0], j + dirs[p][1]
if x < 0 or y < 0 or x >= m or y >= n or ~ans[x][y]:
p = (p + 1) % 4
else:
x, y = i + dirs[k], j + dirs[k + 1]
if 0 <= x < m and 0 <= y < n and ans[x][y] == -1:
i, j = x, y
break
k = (k + 1) % 4
return ans
```

Expand All @@ -90,26 +99,25 @@ class Solution:
class Solution {
public int[][] spiralMatrix(int m, int n, ListNode head) {
int[][] ans = new int[m][n];
for (int[] row : ans) {
for (var row : ans) {
Arrays.fill(row, -1);
}
int i = 0, j = 0, p = 0;
int[][] dirs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int i = 0, j = 0, k = 0;
final int[] dirs = {0, 1, 0, -1, 0};
while (true) {
ans[i][j] = head.val;
head = head.next;
if (head == null) {
break;
}
while (true) {
int x = i + dirs[p][0], y = j + dirs[p][1];
if (x < 0 || y < 0 || x >= m || y >= n || ans[x][y] >= 0) {
p = (p + 1) % 4;
} else {
int x = i + dirs[k], y = j + dirs[k + 1];
if (x >= 0 && x < m && y >= 0 && y < n && ans[x][y] == -1) {
i = x;
j = y;
break;
}
k = (k + 1) % 4;
}
}
return ans;
Expand All @@ -132,20 +140,22 @@ class Solution {
public:
vector<vector<int>> spiralMatrix(int m, int n, ListNode* head) {
vector<vector<int>> ans(m, vector<int>(n, -1));
int i = 0, j = 0, p = 0;
vector<vector<int>> dirs = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int i = 0, j = 0, k = 0;
const int dirs[5] = {0, 1, 0, -1, 0};
while (1) {
ans[i][j] = head->val;
head = head->next;
if (!head) break;
if (!head) {
break;
}
while (1) {
int x = i + dirs[p][0], y = j + dirs[p][1];
if (x < 0 || y < 0 || x >= m || y >= n || ans[x][y] >= 0)
p = (p + 1) % 4;
else {
i = x, j = y;
int x = i + dirs[k], y = j + dirs[k + 1];
if (x >= 0 && x < m && y >= 0 && y < n && ans[x][y] == -1) {
i = x;
j = y;
break;
}
k = (k + 1) % 4;
}
}
return ans;
Expand All @@ -169,22 +179,20 @@ func spiralMatrix(m int, n int, head *ListNode) [][]int {
ans[i][j] = -1
}
}
i, j, p := 0, 0, 0
dirs := [][]int{{0, 1}, {1, 0}, {0, -1}, {-1, 0}}
i, j, k := 0, 0, 0
dirs := [5]int{0, 1, 0, -1, 0}
for {
ans[i][j] = head.Val
head = head.Next
if head == nil {
if head = head.Next; head == nil {
break
}
for {
x, y := i+dirs[p][0], j+dirs[p][1]
if x < 0 || y < 0 || x >= m || y >= n || ans[x][y] >= 0 {
p = (p + 1) % 4
} else {
x, y := i+dirs[k], j+dirs[k+1]
if x >= 0 && x < m && y >= 0 && y < n && ans[x][y] == -1 {
i, j = x, y
break
}
k = (k + 1) % 4
}
}
return ans
Expand All @@ -205,26 +213,24 @@ func spiralMatrix(m int, n int, head *ListNode) [][]int {
*/

function spiralMatrix(m: number, n: number, head: ListNode | null): number[][] {
const dirs = [
[0, 1],
[1, 0],
[0, -1],
[-1, 0],
];
let ans = Array.from({ length: m }, v => new Array(n).fill(-1));
let i = 0,
j = 0,
k = 0;
while (head) {
const ans: number[][] = Array.from({ length: m }, () => Array(n).fill(-1));
const dirs: number[] = [0, 1, 0, -1, 0];
let [i, j, k] = [0, 0, 0];
while (1) {
ans[i][j] = head.val;
head = head.next;
let x = i + dirs[k][0];
let y = j + dirs[k][1];
if (x < 0 || x > m - 1 || y < 0 || y > n - 1 || ans[x][y] != -1) {
if (!head) {
break;
}
while (1) {
const [x, y] = [i + dirs[k], j + dirs[k + 1]];
if (x >= 0 && x < m && y >= 0 && y < n && ans[x][y] === -1) {
i = x;
j = y;
break;
}
k = (k + 1) % 4;
}
i = i + dirs[k][0];
j = j + dirs[k][1];
}
return ans;
}
Expand Down
Loading
Loading