rename dir name called digitals prefix

Author: qtsunami

two-sum/main.go 1.two-sum/main.go

@@ -0,0 +1,99 @@
+package main
+
+type Node struct {
+	value int
+	next  *Node
+}
+
+type MyCircularQueue struct {
+	headNode *Node
+	rearNode *Node
+	size     int
+	capacity int
+}
+
+func Constructor(k int) MyCircularQueue {
+	return MyCircularQueue{
+		headNode: nil,
+		rearNode: nil,
+		size:     0,
+		capacity: k,
+	}
+}
+
+func (this *MyCircularQueue) EnQueue(value int) bool {
+
+	if this.IsFull() {
+		return false
+	}
+
+	enNode := Node{
+		value: value,
+		next:  nil,
+	}
+
+	// If headNode is nil, headNode and rearNode equals enNode
+	if this.IsEmpty() {
+		this.headNode = &enNode
+		this.rearNode = &enNode
+	} else {
+		// origin rearNode next point is enNode， and new rearNode is EnNode
+		this.rearNode.next = &enNode
+		this.rearNode = &enNode
+	}
+
+	this.size++
+
+	return true
+}
+
+func (this *MyCircularQueue) DeQueue() bool {
+	if this.IsEmpty() {
+		return false
+	}
+	this.headNode = this.headNode.next
+	this.size--
+
+	if this.IsEmpty() {
+		this.rearNode = nil
+	}
+	return true
+}
+
+func (this *MyCircularQueue) Front() int {
+
+	if this.IsEmpty() {
+		return -1
+	}
+	return this.headNode.value
+}
+
+func (this *MyCircularQueue) Rear() int {
+	if this.IsEmpty() {
+		return -1
+	}
+	return this.rearNode.value
+}
+
+func (this *MyCircularQueue) IsEmpty() bool {
+	return this.size == 0
+}
+
+func (this *MyCircularQueue) IsFull() bool {
+	return this.size == this.capacity
+}
+
+/**
+ * Your MyCircularQueue object will be instantiated and called as such:
+ * obj := Constructor(k);
+ * param_1 := obj.EnQueue(value);
+ * param_2 := obj.DeQueue();
+ * param_3 := obj.Front();
+ * param_4 := obj.Rear();
+ * param_5 := obj.IsEmpty();
+ * param_6 := obj.IsFull();
+ */
+
+func main() {
+
+}

best-time-to-buy-and-sell-stock-ii/main.go 122.best-time-to-buy-and-sell-stock-ii/main.go

@@ -3,28 +3,28 @@
 
 | 序号 | 题目名称 | 难度 | 地址 | 进度 |
 |----|----|----|----|----|
-| 1 | [两数之和](./two-sum/main.go)| 简单 | https://leetcode.cn/problems/two-sum/ | 已完成 |
-| 9 | [回文数](./palindrome-number/main.go)| 简单 | https://leetcode.cn/problems/palindrome-number/ | 已完成 |
-| 21| [合并两个有序链表](./merge-two-sorted-lists/main.go) | 简单 | https://leetcode.cn/problems/merge-two-sorted-lists/ | 已完成 |
-| 26 | [删除有序数组中的重复项](./remove-duplicates-from-sorted-array/main.go) | 简单 | https://leetcode.cn/problems/remove-duplicates-from-sorted-array/ | 已完成 |
-| 66 | [加一](./plus-one/main.go) | 简单 | https://leetcode.cn/problems/plus-one/ | 已完成 |
-| 83 | [删除排序链表中的重复元素](./remove-duplicates-from-sorted-list/main.go) | 简单 | https://leetcode.cn/problems/remove-duplicates-from-sorted-list/ | 已完成 |
-| 122 | [买卖股票的最佳时机 II](./single-number/main.go) | 中等 | https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/ | 已完成 |
-| 136 | [只出现一次的数字](./single-number/main.go) | 简单 | https://leetcode.cn/problems/single-number/ | 已完成 |
-| 141 | [环形链表](./linked-list-cycle/main.go) | 简单 | https://leetcode.cn/problems/linked-list-cycle/ | 已完成 |
-| 142 | [环形链表 II](./linked-list-cycle-ii/main.go) | 中等 | https://leetcode.cn/problems/linked-list-cycle-ii/ | 进行中 |
-| 189 | [轮转数组](./rotate-array/main.go) | 中等 | https://leetcode.cn/problems/rotate-array/ | 已完成 |
-| 206 | [反转链表](./reverse-linked-list/main.go) | 简单 | https://leetcode.cn/problems/reverse-linked-list/ | 已完成 |
-| 217 | [存在重复元素](./contains-duplicate/main.go) | 简单 | https://leetcode.cn/problems/contains-duplicate/ | 已完成 |
-| 234 | [回文链表](./palindrome-linked-list/main.go) | 简单 | https://leetcode.cn/problems/palindrome-linked-list/ | 已完成 |
-| 283 | [移动零](./move-zeroes/main.go) | 简单 | https://leetcode.cn/problems/move-zeroes/ | 已完成 |
-| 344 | [反转字符串](./reverse-string/main.go) | 简单 | https://leetcode.cn/problems/reverse-string/ | 已完成 |
-| 350 | [两个数组的交集 II](./intersection-of-two-arrays-ii/main.go) | 简单 | https://leetcode.cn/problems/intersection-of-two-arrays-ii/ | 已完成 |
-| 498 | [对角线遍历](./diagonal-traverse/main.go) | 中等 | https://leetcode.cn/problems/diagonal-traverse/ | 已完成 |
-| 622 | [设计循环队列](./diagonal-traverse/main.go) | 中等 | https://leetcode.cn/problems/design-circular-queue/ | 已完成 |
-| 707 | [设计链表](./design-linked-list/main.go) | 中等 | https://leetcode.cn/problems/design-linked-list/ | 已完成 |
-| 724 | [寻找数组的中心下标](./find-pivot-index/main.go) | 简单 | https://leetcode.cn/problems/find-pivot-index/ | 已完成 |
-| 747 | [至少是其他数字两倍的最大数](./largest-number-at-least-twice-of-others/main.go) | 简单 | https://leetcode.cn/problems/largest-number-at-least-twice-of-others/ | 已完成 |
+| [1.两数之和](./1.two-sum/main.go)| 简单 | https://leetcode.cn/problems/two-sum/ | 已完成 |
+| [9.回文数](./9.palindrome-number/main.go)| 简单 | https://leetcode.cn/problems/palindrome-number/ | 已完成 |
+| [21.合并两个有序链表](./21.merge-two-sorted-lists/main.go) | 简单 | https://leetcode.cn/problems/merge-two-sorted-lists/ | 已完成 |
+| [26.删除有序数组中的重复项](./26.remove-duplicates-from-sorted-array/main.go) | 简单 | https://leetcode.cn/problems/remove-duplicates-from-sorted-array/ | 已完成 |
+| [66.加一](./66.plus-one/main.go) | 简单 | https://leetcode.cn/problems/plus-one/ | 已完成 |
+| [83.删除排序链表中的重复元素](./83.remove-duplicates-from-sorted-list/main.go) | 简单 | https://leetcode.cn/problems/remove-duplicates-from-sorted-list/ | 已完成 |
+| [122.买卖股票的最佳时机 II](./122.best-time-to-buy-and-sell-stock-ii/main.go) | 中等 | https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/ | 已完成 |
+| [136.只出现一次的数字](./136.single-number/main.go) | 简单 | https://leetcode.cn/problems/single-number/ | 已完成 |
+| [141.环形链表](./141.linked-list-cycle/main.go) | 简单 | https://leetcode.cn/problems/linked-list-cycle/ | 已完成 |
+| [142.环形链表 II](./142.linked-list-cycle-ii/main.go) | 中等 | https://leetcode.cn/problems/linked-list-cycle-ii/ | 进行中 |
+| [189.轮转数组](./189.rotate-array/main.go) | 中等 | https://leetcode.cn/problems/rotate-array/ | 已完成 |
+| [206.反转链表](./206.reverse-linked-list/main.go) | 简单 | https://leetcode.cn/problems/reverse-linked-list/ | 已完成 |
+| [217.存在重复元素](./217.contains-duplicate/main.go) | 简单 | https://leetcode.cn/problems/contains-duplicate/ | 已完成 |
+| [234.回文链表](./234.palindrome-linked-list/main.go) | 简单 | https://leetcode.cn/problems/palindrome-linked-list/ | 已完成 |
+| [283.移动零](./283.move-zeroes/main.go) | 简单 | https://leetcode.cn/problems/move-zeroes/ | 已完成 |
+| [344.反转字符串](./344.reverse-string/main.go) | 简单 | https://leetcode.cn/problems/reverse-string/ | 已完成 |
+| [350.两个数组的交集 II](./350.intersection-of-two-arrays-ii/main.go) | 简单 | https://leetcode.cn/problems/intersection-of-two-arrays-ii/ | 已完成 |
+| [498.对角线遍历](./498.diagonal-traverse/main.go) | 中等 | https://leetcode.cn/problems/diagonal-traverse/ | 已完成 |
+| [622.设计循环队列](./622.design-circular-queue/main.go) | 中等 | https://leetcode.cn/problems/design-circular-queue/ | 已完成 |
+| [707.设计链表](./707.design-linked-list/main.go) | 中等 | https://leetcode.cn/problems/design-linked-list/ | 已完成 |
+| [724.寻找数组的中心下标](./724.find-pivot-index/main.go) | 简单 | https://leetcode.cn/problems/find-pivot-index/ | 已完成 |
+| [747.至少是其他数字两倍的最大数](./747.largest-number-at-least-twice-of-others/main.go) | 简单 | https://leetcode.cn/problems/largest-number-at-least-twice-of-others/ | 已完成 |