Skip to content

Commit adc15f7

Browse files
authored
Rm/get rid of extra comments (#134)
1 parent e54b65b commit adc15f7

File tree

2 files changed

+2
-7
lines changed

2 files changed

+2
-7
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -54,7 +54,7 @@ Welcome to **Data Structures and Algorithms in Go**! 🎉 This project is design
5454
* [Longest Valid Parentheses](./stack/longest_valid_parentheses_test.go)
5555
* [Queues](./queue/README.md)
5656
* [A Queue Using Stacks](./queue/queue_using_stacks_test.go)
57-
* [Implement a Circular Queue Array](./circular_queue_using_array_test.go)
57+
* [Implement a Circular Queue Array](./queue/circular_queue_using_array_test.go)
5858
* [Is Binary Tree Symmetrical](./queue/is_tree_symmetrical_test.go)
5959
* [Generate Binary Numbers](./queue/generate_binary_numbers_test.go)
6060
* [Find The Maximum Sub-array of Length K](./queue/maximum_of_sub_arrays_test.go)
@@ -122,7 +122,7 @@ Welcome to **Data Structures and Algorithms in Go**! 🎉 This project is design
122122
* [Word Ladder](./graph/word_ladder_test.go)
123123
* [Network Delay Time](./graph/network_delay_time_test.go)
124124
* [Number of Islands](./graph/number_of_islands_test.go)
125-
* [Dependency Order](./graph/dependency_order_test)
125+
* [Dependency Order](./graph/dependency_order_test.go)
126126
* [Greedy Algorithms](./greedy/README.md)
127127
* [Maximum Stock Profit](./greedy/max_stock_profit_test.go)
128128
* [Activity Selector](./greedy/activity_selector_test.go)

array/README.md

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -14,11 +14,8 @@ package main
1414
import "fmt"
1515

1616
func main() {
17-
// Declare an array with 2 int elements, defaulting to 0.
1817
var nums1 [2]int
19-
// Initialize an array with 3 int elements.
2018
nums2 := [3]int{1, 2, 3}
21-
// Print both arrays.
2219
fmt.Println(nums1, nums2) // Prints [0 0] [1 2 3]
2320
}
2421
```
@@ -66,13 +63,11 @@ import "fmt"
6663
func main() {
6764
// Initialize a slice with 6 elements.
6865
nums := []int{1, 2, 3, 4, 5, 6}
69-
// Sequentially modify the slice.
7066
nums = nums[:len(nums)-1] // Drop the last element
7167
nums = nums[1:] // Drop the first element
7268
nums = nums[1:] // Keep all elements from index 1 to the end
7369
nums = nums[:2] // Keep all elements up to (but not including) index 2
7470
nums = nums[1:2] // Keep only the element at index 1
75-
// Print final slice.
7671
fmt.Println(nums) // Prints [4]
7772
}
7873
```

0 commit comments

Comments
 (0)