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.

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

Add deque in Go #211

Merged
merged 4 commits into from Oct 3, 2023
Merged
Show file tree
Hide file tree
Changes from 2 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Jump to
Jump to file
Failed to load files.
Diff view
Diff view
4 changes: 2 additions & 2 deletions README.md
Expand Up @@ -1713,8 +1713,8 @@ Com o objetivo de alcançar uma abrangência maior e encorajar mais pessoas a co
</a>
</td>
<td> <!-- Go -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/github/github-original.svg" />
<a href="./src/go/deque.go">
<img align="center" height="25" src="https://cdn.jsdelivr.net/gh/devicons/devicon/icons/go/go-original.svg" />
</a>
</td>
<td> <!-- Ruby -->
Expand Down
64 changes: 64 additions & 0 deletions src/go/deque.go
@@ -0,0 +1,64 @@
import (
"testing"
"github.com/stretchr/testify/assert"
)

type Deque struct {
Store []int
}

// Time complexity: O(1)
func (deque *Deque) RPush(element int) {
deque.Store = append(deque.Store, element)
}

// Time complexity: O(n)
func (deque *Deque) LPush(element int) {
deque.Store = append([]int{element}, deque.Store...)
}

// Time complexity: O(1)
func (deque *Deque) RPop() *int {
if len(deque.Store) == 0 {
return nil
}

element := deque.Store[len(deque.Store) - 1]
deque.Store = deque.Store[:len(deque.Store) - 1]

return &element
}

// Time complexity: O(n)
func (deque *Deque) LPop() *int {
if len(deque.Store) == 0 {
return nil
}

element := deque.Store[0]
deque.Store = deque.Store[1:]

return &element
}

func TestDeque(t *testing.T) {
deque := Deque{}

deque.RPush(1)
deque.RPush(2)
deque.RPush(3)

assert.Equal(t, 3, *deque.RPop())
assert.Equal(t, 2, *deque.RPop())
assert.Equal(t, 1, *deque.RPop())
assert.Nil(t, deque.RPop())

deque.LPush(1)
deque.LPush(2)
deque.LPush(3)

assert.Equal(t, 1, *deque.RPop())
assert.Equal(t, 2, *deque.RPop())
assert.Equal(t, 3, *deque.RPop())
assert.Nil(t, deque.RPop())
}