add

Author: wolfstudy

jiuzhangsuanfa/stack/satck.go

@@ -0,0 +1,145 @@
+package stack
+
+type Stack struct {
+	array []interface{}
+}
+
+func NewStack() *Stack {
+	s := make([]interface{}, 0)
+	return &Stack{s}
+}
+
+func (s *Stack) Size() int {
+	return len(s.array)
+}
+
+func (s *Stack) Empty() bool {
+	return len(s.array) == 0
+}
+
+func (s *Stack) Push(value interface{}) {
+	s.array = append(s.array, value)
+}
+func (s *Stack) Swap(i int, j int) bool {
+	if i > s.Size()-1 || i < 0 {
+		return false
+	}
+	if j > s.Size()-1 || j < 0 {
+		return false
+	}
+	s.array[i], s.array[j] = s.array[j], s.array[i]
+
+	return true
+
+}
+func (s *Stack) Pop() interface{} {
+	stackLen := len(s.array)
+	if stackLen == 0 {
+		return nil
+	}
+	e := s.array[stackLen-1]
+	s.array = s.array[:stackLen-1]
+
+	return e
+}
+func (s *Stack) RemoveAt(index int) bool {
+	if index > s.Size()-1 || index < 0 {
+		return false
+	}
+	if index < s.Size()-1 {
+		s.array = append(s.array[:index], s.array[index+1:]...)
+	} else {
+		s.array = s.array[:index]
+	}
+	return true
+}
+
+func (s *Stack) Erase(begin int, end int) bool {
+	size := s.Size()
+	if begin < 0 || end < 0 || begin >= end || begin > size || end > size {
+		return false
+	}
+	for i := begin; i < end; i++ {
+		if !s.RemoveAt(begin) {
+			return false
+		}
+	}
+	return true
+}
+
+func (s *Stack) Insert(index int, value interface{}) bool {
+	if index > s.Size()-1 || index < 0 {
+		return false
+	}
+
+	lastArray := make([]interface{}, 0)
+	lastArray = append(lastArray, s.array[index:]...)
+	s.array = s.array[:index]
+	s.array = append(s.array, value)
+	s.array = append(s.array, lastArray...)
+	return true
+}
+
+func (s *Stack) Top(i int) interface{} {
+	stackLen := s.Size()
+	if stackLen+i > stackLen-1 || stackLen+i < 0 {
+		return nil
+	}
+	return s.array[stackLen+i]
+}
+
+func (s *Stack) SetTop(i int, value interface{}) bool {
+	stackLen := s.Size()
+	if stackLen+i > stackLen-1 || stackLen+i < 0 {
+		return false
+	}
+	s.array[stackLen+i] = value
+	return true
+}
+
+func (s *Stack) CountBool(val bool) int {
+	var count int
+	for _, e := range s.array {
+		if v, ok := e.(bool); ok && v == val {
+			count++
+		}
+	}
+	return count
+}
+
+func Swap(s *Stack, other *Stack) {
+	if s.Size() == 0 && other.Size() == 0 {
+		return
+	}
+	if other.Size() == 0 {
+		other.array = s.array[:s.Size()]
+		s.array = make([]interface{}, 0)
+	}
+	if s.Size() == 0 {
+		s.array = other.array[:other.Size()]
+		other.array = make([]interface{}, 0)
+	}
+	s.array, other.array = other.array, s.array
+
+}
+
+func (s *Stack) Copy() *Stack {
+	bak := make([]interface{}, s.Size())
+	copy(bak, s.array)
+
+	return &Stack{
+		array: bak,
+	}
+}
+
+func (s *Stack) Equal(other *Stack) bool {
+	if s.Size() != other.Size() {
+		return false
+	}
+	for i := 0; i < s.Size(); i++ {
+		if s.array[i] != other.array[i] {
+			return false
+		}
+	}
+	return true
+}