Skip to content

number of provinces fixes #88

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

Merged
avivasyuta merged 1 commit into from
Mar 2, 2025
Merged

number of provinces fixes #88

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
6 changes: 3 additions & 3 deletions content/blog/disjoint_set/go/solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,11 +5,11 @@ type DisjointSet struct {
nodes []int
}

func NewDisjointSet(size int) DisjointSet {
func NewDisjointSet(n int) DisjointSet {
// Создаем слайс заданного размера по количеству элементов
nodes := make([]int, size)
nodes := make([]int, n)

for i := 0; i < size; i++ {
for i := 0; i < n; i++ {
// При инициализации считаем что каждый элемент обособлен и не соединен с другими.
// В таком случае каждый элемент является рутовым сам для себя
nodes[i] = i
Expand Down
16 changes: 8 additions & 8 deletions content/blog/disjoint_set/go/solution_test.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,16 +8,16 @@ import (
func Test_DisjointSet(t *testing.T) {
set := NewDisjointSet(8)

set.union(0, 2)
set.union(0, 1)
set.union(2, 3)
set.union(1, 3)
t.Run("Create disjoint set", func(t *testing.T) {
set.union(0, 2)
set.union(0, 1)
set.union(2, 3)
set.union(1, 3)

set.union(4, 5)
set.union(4, 6)
set.union(5, 6)
set.union(4, 5)
set.union(4, 6)
set.union(5, 6)

t.Run("Create disjoint set", func(t *testing.T) {
assert.Equal(t, []int{0, 0, 0, 0, 4, 4, 4, 7}, set.nodes)
})

Expand Down
2 changes: 0 additions & 2 deletions content/blog/disjoint_set/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -152,8 +152,6 @@ describe('DisjointSet', () => {

Теперь оценим сложность каждого метода созданной нами структуры данных.

### find

**По времени**

- `find` — сложность `O(1)`, так как мы получаем значение по индексу в массиве.
Expand Down