project ci conf (#1)

project ci conf

Author: zwfang

.codacy.yml

@@ -0,0 +1,3 @@
+---
+exclude_paths:
+  - '**/*.md'

.codecov.yml

@@ -0,0 +1,21 @@
+codecov:
+  notify:
+    require_ci_to_pass: yes
+
+coverage:
+  round: up
+  range: 0..10
+  precision: 2
+
+  status:
+    project: yes
+    patch: yes
+    changes: yes
+
+comment:
+  layout: "reach, diff, flags, files"
+  behavior: default
+  require_changes: false  # if true: only post the comment if coverage changes
+  require_base: yes        # [yes :: must have a base report to post]
+  require_head: yes       # [yes :: must have a head report to post]
+  branches: null

.gitignore

@@ -10,3 +10,12 @@
 
 # Output of the go coverage tool, specifically when used with LiteIDE
 *.out
+
+# JetBrains
+.idea/
+
+# vs code
+.vscode/
+
+# mac 
+.DS_Store

.travis.yml

@@ -0,0 +1,19 @@
+language: go
+
+go:
+  - "1.11.x"
+
+go_import_path: leetcode
+
+install:
+  - go get -t -v ./...
+
+script:
+  - go test ./... -race -coverprofile=coverage.txt -covermode=atomic
+
+after_success:
+    - bash <(curl -s https://codecov.io/bash)
+
+branches:
+  only:
+    - master

Makefile

@@ -0,0 +1,14 @@
+# Basic go commands
+GOCMD=go
+GOBUILD=$(GOCMD) build
+GOCLEAN=$(GOCMD) clean
+GOTEST=$(GOCMD) test
+GOGET=$(GOCMD) get
+
+test:
+	@echo "unit test"
+	$(GOTEST) -v ./...
+
+clean:
+	@echo "clean test cache"
+	$(GOCLEAN) -testcache

ut.sh

@@ -0,0 +1,16 @@
+#!/bin/bash
+
+function cleanTestCache() {
+    go clean -testcache;
+}
+
+function test() {
+    go test ./...;
+}
+
+case $1 in
+    clean) cleanTestCache;
+    ;;
+esac
+
+test;

utils/infinite.go

@@ -0,0 +1,14 @@
+package utils
+
+const (
+	// MaxUint max unsigned int.
+	MaxUint = ^uint(0)
+	// MaxInt max int.
+	MaxInt = int(MaxUint >> 1)
+
+	// MinUint min unsigned int.
+	MinUint = 0
+
+	// MinInt min int
+	MinInt = -MaxInt - 1
+)

utils/maxint.go

@@ -0,0 +1,18 @@
+package utils
+
+// CalcMaxInt calc max int from multi nums.
+func CalcMaxInt(nums ...int) (res int) {
+	// 此处也可使用堆排序，构建大顶堆，heapify之后直接取最大值.
+	if len(nums) == 0 {
+		return 0
+	}
+
+	res = MinInt
+
+	for _, num := range nums {
+		if num > res {
+			res = num
+		}
+	}
+	return
+}

utils/maxint_test.go

@@ -0,0 +1,17 @@
+package utils
+
+import "testing"
+
+func TestCalcMaxInt(t *testing.T) {
+	testData := [][]int{
+		{},
+		{3, 4, 67, 8},
+	}
+	expectedData := []int{0, 67}
+
+	for index, data := range testData {
+		if res := CalcMaxInt(data...); res != expectedData[index] {
+			t.Errorf("expected %d, got %d", expectedData[index], res)
+		}
+	}
+}

utils/minint.go

@@ -0,0 +1,18 @@
+package utils
+
+// CalcMinInt calc min int from multi nums.
+func CalcMinInt(nums ...int) (res int) {
+	// 此处也可使用堆排序，构建小顶堆，heapify之后直接取最小值.
+	if len(nums) == 0 {
+		return 0
+	}
+
+	res = MaxInt
+
+	for _, num := range nums {
+		if num < res {
+			res = num
+		}
+	}
+	return
+}

utils/minint_test.go

@@ -0,0 +1,17 @@
+package utils
+
+import "testing"
+
+func TestCalcMinInt(t *testing.T) {
+	testData := [][]int{
+		{3, 4, 67, 8},
+		{},
+	}
+	expectedData := []int{3, 0}
+
+	for index, data := range testData {
+		if res := CalcMinInt(data...); res != expectedData[index] {
+			t.Errorf("expected %d, got %d", expectedData[index], res)
+		}
+	}
+}

utils/set.go

@@ -0,0 +1,64 @@
+package utils
+
+// Exists 空结构体
+var Exists = struct{}{}
+
+// Set data structure implement by go.
+type Set map[interface{}]struct{}
+
+// NewSet 初始化set
+func NewSet(items ...interface{}) Set {
+	s := make(Set)
+	s.Add(items...)
+	return s
+}
+
+// Add 向set中添加元素
+func (s Set) Add(items ...interface{}) error {
+	for _, item := range items {
+		s[item] = Exists
+	}
+	return nil
+}
+
+// Contains 查看set中是否存在item
+func (s Set) Contains(item interface{}) bool {
+	_, ok := s[item]
+	return ok
+}
+
+// Size  集合的大小
+func (s Set) Size() int {
+	return len(s)
+}
+
+// Clear 清空集合
+func (s Set) Clear() {
+	s = make(Set)
+}
+
+// Equal 判断两个set是否相等
+func (s Set) Equal(other Set) bool {
+	if s.Size() != other.Size() {
+		return false
+	}
+	for key := range s {
+		if !other.Contains(key) {
+			return false
+		}
+	}
+	return true
+}
+
+//IsSubset 判断s是否是other的子集
+func (s Set) IsSubset(other Set) bool {
+	if s.Size() > other.Size() {
+		return false
+	}
+	for key := range s {
+		if !other.Contains(key) {
+			return false
+		}
+	}
+	return true
+}