SYMBOL INDEX (554 symbols across 345 files) FILE: algorithm/leetcode/001/ac001.go function twoSum (line 3) | func twoSum(nums []int, target int) []int { FILE: algorithm/leetcode/001/ac001_test.go type argument (line 8) | type argument struct type answer (line 13) | type answer struct type example (line 17) | type example struct function TestOk (line 22) | func TestOk(t *testing.T) { FILE: algorithm/leetcode/007/ac007.go function reverse (line 5) | func reverse(x int) int { FILE: algorithm/leetcode/007/ac007_test.go type argument (line 8) | type argument struct type answer (line 12) | type answer struct type example (line 16) | type example struct function Test_reverse (line 21) | func Test_reverse(t *testing.T) { FILE: algorithm/leetcode/009/ac009.go function isPalindrome (line 4) | func isPalindrome(x int) bool { FILE: algorithm/leetcode/009/ac009_test.go function Test_isPalindrome (line 8) | func Test_isPalindrome(t *testing.T) { FILE: algorithm/leetcode/013/ac013.go function romanToInt (line 3) | func romanToInt(s string) int { FILE: algorithm/leetcode/013/ac013_test.go function Test_romanToInt (line 8) | func Test_romanToInt(t *testing.T) { FILE: algorithm/leetcode/014/ac014.go function longestCommonPrefix (line 7) | func longestCommonPrefix(strs []string) string { FILE: algorithm/leetcode/014/ac014_test.go function Test_longestCommonPrefix (line 8) | func Test_longestCommonPrefix(t *testing.T) { FILE: algorithm/leetcode/020/ac020.go function isValid (line 5) | func isValid(s string) bool { FILE: algorithm/leetcode/020/ac020_test.go function Test_isValid (line 8) | func Test_isValid(t *testing.T) { FILE: algorithm/leetcode/021/ac021.go type ListNode (line 3) | type ListNode struct function mergeTwoLists (line 8) | func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode { FILE: algorithm/leetcode/026/ac026.go function removeDuplicates (line 3) | func removeDuplicates(nums []int) int { FILE: algorithm/leetcode/027/ac027.go function removeElement (line 3) | func removeElement(nums []int, val int) int { FILE: algorithm/leetcode/028/ac028.go function strStr (line 3) | func strStr(haystack string, needle string) int { FILE: algorithm/leetcode/035/ac035.go function searchInsert (line 3) | func searchInsert(nums []int, target int) int { FILE: algorithm/leetcode/035/ac035_test.go function Test_searchInsert (line 8) | func Test_searchInsert(t *testing.T) { FILE: algorithm/leetcode/038/ac038.go function countAndSay (line 5) | func countAndSay(n int) string { FILE: algorithm/leetcode/053/ac053.go function maxSubArray (line 3) | func maxSubArray(nums []int) int { FILE: algorithm/leetcode/058/ac058.go function lengthOfLastWord (line 7) | func lengthOfLastWord(s string) int { function lengthOfLastWord2 (line 18) | func lengthOfLastWord2(s string) int { FILE: algorithm/leetcode/058/ac058_test.go function Test_lengthOfLastWord (line 8) | func Test_lengthOfLastWord(t *testing.T) { FILE: algorithm/leetcode/066/ac066.go function plusOne (line 3) | func plusOne(digits []int) []int { FILE: algorithm/leetcode/067/ac067.go function addBinary (line 3) | func addBinary(a string, b string) string { function addBinary2 (line 29) | func addBinary2(a string, b string) string { FILE: algorithm/leetcode/067/ac067_test.go function Test_addBinary (line 8) | func Test_addBinary(t *testing.T) { FILE: algorithm/leetcode/069/ac069.go function mySqrt (line 3) | func mySqrt(x int) int { FILE: algorithm/leetcode/069/ac069_test.go function Test_mySqrt (line 8) | func Test_mySqrt(t *testing.T) { FILE: algorithm/leetcode/070/ac070.go function climbStairs (line 3) | func climbStairs(n int) int { function climbStairs2 (line 17) | func climbStairs2(n int) int { FILE: algorithm/leetcode/083/ac083.go type ListNode (line 3) | type ListNode struct function deleteDuplicates (line 8) | func deleteDuplicates(head *ListNode) *ListNode { FILE: algorithm/leetcode/088/ac088.go function merge (line 3) | func merge(nums1 []int, m int, nums2 []int, n int) { FILE: algorithm/leetcode/100/ac100.go type TreeNode (line 3) | type TreeNode struct function isSameTree (line 9) | func isSameTree(p *TreeNode, q *TreeNode) bool { FILE: algorithm/leetcode/101/ac101.go type TreeNode (line 3) | type TreeNode struct function isSymmetric (line 9) | func isSymmetric(root *TreeNode) bool { function isSame (line 13) | func isSame(left, right *TreeNode) bool { FILE: algorithm/leetcode/104/ac104.go type TreeNode (line 3) | type TreeNode struct function maxDepth (line 9) | func maxDepth(root *TreeNode) int { FILE: algorithm/leetcode/107/ac107.go type TreeNode (line 3) | type TreeNode struct function levelOrderBottom (line 9) | func levelOrderBottom(root *TreeNode) [][]int { FILE: algorithm/leetcode/107/ac107_test.go function Test_levelOrderBottom (line 8) | func Test_levelOrderBottom(t *testing.T) { FILE: algorithm/leetcode/108/ac108.go type TreeNode (line 3) | type TreeNode struct function sortedArrayToBST (line 9) | func sortedArrayToBST(nums []int) *TreeNode { FILE: algorithm/leetcode/110/ac110.go type TreeNode (line 3) | type TreeNode struct function isBalanced (line 9) | func isBalanced(root *TreeNode) bool { function depth (line 20) | func depth(root *TreeNode) int { FILE: algorithm/leetcode/111/ac111.go type TreeNode (line 3) | type TreeNode struct function minDepth (line 9) | func minDepth(root *TreeNode) int { FILE: algorithm/leetcode/112/ac112.go type TreeNode (line 3) | type TreeNode struct function hasPathSum (line 9) | func hasPathSum(root *TreeNode, sum int) bool { FILE: algorithm/leetcode/118/ac118.go function generate (line 3) | func generate(numRows int) [][]int { FILE: algorithm/leetcode/119/ac119.go function getRow (line 3) | func getRow(rowIndex int) []int { FILE: algorithm/leetcode/120/ac120.go function minimumTotal (line 5) | func minimumTotal(triangle [][]int) int { function myMin (line 17) | func myMin(a, b int) int { FILE: algorithm/leetcode/120/ac120_test.go function Test_minimumTotal (line 8) | func Test_minimumTotal(t *testing.T) { FILE: algorithm/leetcode/121/ac121.go function maxProfit (line 3) | func maxProfit(prices []int) int { FILE: algorithm/leetcode/121/ac121_test.go function Test_maxProfit (line 8) | func Test_maxProfit(t *testing.T) { FILE: algorithm/leetcode/122/ac122.go function maxProfit (line 3) | func maxProfit(prices []int) int { FILE: algorithm/leetcode/125/ac125.go function isPalindrome (line 3) | func isPalindrome(s string) bool { function isCharacter (line 26) | func isCharacter(c byte) bool { function lowerCharacter (line 34) | func lowerCharacter(c byte) byte { FILE: algorithm/leetcode/125/ac125_test.go function Test_isCharacter (line 8) | func Test_isCharacter(t *testing.T) { FILE: algorithm/leetcode/136/ac136.go function singleNumber (line 3) | func singleNumber(nums []int) int { FILE: algorithm/leetcode/137/ac137.go function singleNumber (line 3) | func singleNumber(nums []int) int { function singleNumber2 (line 23) | func singleNumber2(nums []int) int { function singleNumber3 (line 32) | func singleNumber3(nums []int) int { function singleNumber4 (line 50) | func singleNumber4(nums []int) int { FILE: algorithm/leetcode/137/ac137_test.go function Test_singleNumber (line 8) | func Test_singleNumber(t *testing.T) { FILE: algorithm/leetcode/160/ac160.go type ListNode (line 3) | type ListNode struct function getIntersectionNode (line 8) | func getIntersectionNode(headA, headB *ListNode) *ListNode { FILE: algorithm/leetcode/160/ac160_test.go function Test_getIntersectionNode (line 12) | func Test_getIntersectionNode(t *testing.T) { FILE: algorithm/leetcode/167/ac167.go function twoSum (line 3) | func twoSum(numbers []int, target int) []int { FILE: algorithm/leetcode/168/ac141.go function convertToTitle (line 3) | func convertToTitle(n int) string { FILE: algorithm/leetcode/168/ac141_test.go function Test_convertToTitle (line 8) | func Test_convertToTitle(t *testing.T) { FILE: algorithm/leetcode/169/ac169.go function majorityElement (line 3) | func majorityElement(nums []int) int { FILE: algorithm/leetcode/171/ac171.go function titleToNumber (line 3) | func titleToNumber(s string) int { FILE: algorithm/leetcode/172/ac172.go function trailingZeroes (line 3) | func trailingZeroes(n int) int { FILE: algorithm/leetcode/189/ac189.go function rotate (line 3) | func rotate(nums []int, k int) { function reverse (line 21) | func reverse(nums []int) { FILE: algorithm/leetcode/189/ac189_test.go function Test_rotate (line 8) | func Test_rotate(t *testing.T) { FILE: algorithm/leetcode/191/ac191.go function hammingWeight (line 3) | func hammingWeight(n uint32) int { FILE: algorithm/leetcode/191/ac191_test.go function Test_hammingWeight (line 8) | func Test_hammingWeight(t *testing.T) { FILE: algorithm/leetcode/198/ac198.go function rob (line 3) | func rob(nums []int) int { function maxInt (line 24) | func maxInt(a, b int) int { FILE: algorithm/leetcode/202/ac202.go function isHappy (line 3) | func isHappy(n int) bool { function digitSquareSum (line 20) | func digitSquareSum(n int) int { FILE: algorithm/leetcode/203/ac203.go type ListNode (line 3) | type ListNode struct function removeElements (line 9) | func removeElements(head *ListNode, val int) *ListNode { function removeElements2 (line 24) | func removeElements2(head *ListNode, val int) *ListNode { FILE: algorithm/leetcode/204/ac204.go function countPrimes (line 3) | func countPrimes(n int) int { FILE: algorithm/leetcode/205/ac205.go function isIsomorphic (line 3) | func isIsomorphic(s string, t string) bool { FILE: algorithm/leetcode/205/ac205_test.go function Test_isIsomorphic (line 8) | func Test_isIsomorphic(t *testing.T) { FILE: algorithm/leetcode/206/ac206.go type ListNode (line 3) | type ListNode struct function reverseList (line 8) | func reverseList(head *ListNode) *ListNode { function reverseList1 (line 19) | func reverseList1(head *ListNode) *ListNode { function reverseCore (line 23) | func reverseCore(head, newHead *ListNode) *ListNode { FILE: algorithm/leetcode/217/ac217.go function containsDuplicate (line 5) | func containsDuplicate(nums []int) bool { function containsDuplicate2 (line 20) | func containsDuplicate2(nums []int) bool { FILE: algorithm/leetcode/219/ac219.go function containsNearbyDuplicate (line 3) | func containsNearbyDuplicate(nums []int, k int) bool { FILE: algorithm/leetcode/226/ac226.go type TreeNode (line 3) | type TreeNode struct function invertTree (line 9) | func invertTree(root *TreeNode) *TreeNode { FILE: algorithm/leetcode/231/ac231.go function isPowerOfTwo (line 3) | func isPowerOfTwo(n int) bool { FILE: algorithm/leetcode/234/ac234.go type ListNode (line 3) | type ListNode struct function isPalindrome (line 10) | func isPalindrome(head *ListNode) bool { function isPalindrome2 (line 28) | func isPalindrome2(head *ListNode) bool { FILE: algorithm/leetcode/258/ac258.go function addDigits (line 3) | func addDigits(num int) int { FILE: algorithm/leetcode/263/ac263.go function isUgly (line 3) | func isUgly(num int) bool { FILE: algorithm/leetcode/268/ac268.go function missingNumber (line 5) | func missingNumber(nums []int) int { function missingNumber2 (line 23) | func missingNumber2(nums []int) int { function missingNumber3 (line 31) | func missingNumber3(nums []int) int { FILE: algorithm/leetcode/268/ac268_test.go function Test_missingNumber (line 8) | func Test_missingNumber(t *testing.T) { FILE: algorithm/leetcode/283/ac283.go function moveZeroes (line 3) | func moveZeroes(nums []int) { FILE: algorithm/leetcode/290/ac290.go function wordPattern (line 5) | func wordPattern(pattern string, str string) bool { FILE: algorithm/leetcode/290/ac290_test.go function Test_wordPattern (line 8) | func Test_wordPattern(t *testing.T) { FILE: algorithm/leetcode/292/ac292.go function canWinNim (line 5) | func canWinNim(n int) bool { FILE: algorithm/leetcode/303/ac303.go type NumArray (line 3) | type NumArray struct method SumRange (line 15) | func (this *NumArray) SumRange(i int, j int) int { function Constructor (line 7) | func Constructor(nums []int) NumArray { FILE: algorithm/leetcode/303/ac303_test.go function TestNumArray_SumRange (line 8) | func TestNumArray_SumRange(t *testing.T) { FILE: algorithm/leetcode/326/ac326.go function isPowerOfThree (line 4) | func isPowerOfThree(n int) bool { FILE: algorithm/leetcode/326/ac326_test.go function Test_isPowerOfThree (line 5) | func Test_isPowerOfThree(t *testing.T) { FILE: algorithm/leetcode/342/ac342.go function isPowerOfFour (line 7) | func isPowerOfFour(num int) bool { FILE: algorithm/leetcode/344/ac344.go function reverseString (line 3) | func reverseString(s string) string { FILE: algorithm/leetcode/344/ac344_test.go function Test_reverseString (line 8) | func Test_reverseString(t *testing.T) { FILE: algorithm/leetcode/345/ac345.go function reverseVowels (line 5) | func reverseVowels(s string) string { FILE: algorithm/leetcode/345/ac345_test.go function Test_reverseVowels (line 8) | func Test_reverseVowels(t *testing.T) { FILE: algorithm/leetcode/349/ac349.go function intersection (line 3) | func intersection(nums1 []int, nums2 []int) []int { function intersection2 (line 29) | func intersection2(nums1 []int, nums2 []int) []int { FILE: algorithm/leetcode/349/ac349_test.go function Test_intersection (line 8) | func Test_intersection(t *testing.T) { FILE: algorithm/leetcode/350/ac350.go function intersect (line 3) | func intersect(nums1 []int, nums2 []int) []int { function minInt (line 32) | func minInt(a, b int) int { FILE: algorithm/leetcode/350/ac350_test.go function Test_intersect (line 8) | func Test_intersect(t *testing.T) { FILE: algorithm/leetcode/367/ac367.go function isPerfectSquare (line 3) | func isPerfectSquare(num int) bool { function isPerfectSquare2 (line 20) | func isPerfectSquare2(num int) bool { FILE: algorithm/leetcode/371/ac371.go function getSum (line 3) | func getSum(a int, b int) int { FILE: algorithm/leetcode/383/ac383.go function canConstruct (line 3) | func canConstruct(ransomNote string, magazine string) bool { FILE: algorithm/leetcode/383/ac383_test.go function Test_canConstruct (line 8) | func Test_canConstruct(t *testing.T) { FILE: algorithm/leetcode/387/ac387.go function firstUniqChar (line 3) | func firstUniqChar(s string) int { function firstUniqChar2 (line 23) | func firstUniqChar2(s string) int { FILE: algorithm/leetcode/389/ac389.go function findTheDifference (line 3) | func findTheDifference(s string, t string) byte { function findTheDifference2 (line 23) | func findTheDifference2(s string, t string) byte { FILE: algorithm/leetcode/389/ac389_test.go function Test_findTheDifference (line 8) | func Test_findTheDifference(t *testing.T) { FILE: algorithm/leetcode/400/ac400.go function findNthDigit (line 5) | func findNthDigit(n int) int { FILE: algorithm/leetcode/400/ac400_test.go function Test_findNthDigit (line 8) | func Test_findNthDigit(t *testing.T) { FILE: algorithm/leetcode/404/ac404.go type TreeNode (line 3) | type TreeNode struct function sumOfLeftLeaves (line 9) | func sumOfLeftLeaves(root *TreeNode) int { FILE: algorithm/leetcode/405/ac405.go function toHex (line 3) | func toHex(num int) string { FILE: algorithm/leetcode/405/ac405_test.go function Test_toHex (line 8) | func Test_toHex(t *testing.T) { FILE: algorithm/leetcode/409/ac409.go function longestPalindrome (line 8) | func longestPalindrome(s string) int { FILE: algorithm/leetcode/409/ac409_test.go function Test_longestPalindrome (line 8) | func Test_longestPalindrome(t *testing.T) { FILE: algorithm/leetcode/412/ac412.go function fizzBuzz (line 8) | func fizzBuzz(n int) []string { function number (line 17) | func number(n int) string { function fizzBuzz2 (line 29) | func fizzBuzz2(n int) []string { FILE: algorithm/leetcode/412/ac412_test.go function Test_fizzBuzz (line 8) | func Test_fizzBuzz(t *testing.T) { FILE: algorithm/leetcode/414/ac414.go function thirdMax (line 7) | func thirdMax(nums []int) int { function thirdMax2 (line 30) | func thirdMax2(nums []int) int { FILE: algorithm/leetcode/414/ac414_test.go function Test_thirdMax (line 8) | func Test_thirdMax(t *testing.T) { FILE: algorithm/leetcode/415/ac415.go function addStrings (line 3) | func addStrings(num1 string, num2 string) string { function addStrings2 (line 29) | func addStrings2(num1 string, num2 string) string { FILE: algorithm/leetcode/415/ac415_test.go function Test_addStrings (line 8) | func Test_addStrings(t *testing.T) { FILE: algorithm/leetcode/434/ac434.go function countSegments (line 3) | func countSegments(s string) int { FILE: algorithm/leetcode/437/ac437.go type TreeNode (line 3) | type TreeNode struct function pathSum (line 9) | func pathSum(root *TreeNode, sum int) int { function pathSumFrom (line 16) | func pathSumFrom(node *TreeNode, sum int) int { FILE: algorithm/leetcode/438/ac438.go function findAnagrams (line 3) | func findAnagrams(s string, p string) []int { FILE: algorithm/leetcode/438/ac438_test.go function Test_findAnagrams (line 8) | func Test_findAnagrams(t *testing.T) { FILE: algorithm/leetcode/441/ac441.go function arrangeCoins (line 16) | func arrangeCoins(n int) int { FILE: algorithm/leetcode/441/ac441_test.go function Test_arrangeCoins (line 8) | func Test_arrangeCoins(t *testing.T) { FILE: algorithm/leetcode/443/ac443.go function compress (line 5) | func compress(chars []byte) int { FILE: algorithm/leetcode/443/ac443_test.go function Test_compress (line 8) | func Test_compress(t *testing.T) { FILE: algorithm/leetcode/447/ac447.go function numberOfBoomerangs (line 3) | func numberOfBoomerangs(points [][]int) int { function getDistance (line 25) | func getDistance(a, b []int) int { FILE: algorithm/leetcode/448/ac448.go function findDisappearedNumbers (line 3) | func findDisappearedNumbers(nums []int) []int { function abs (line 21) | func abs(n int) int { FILE: algorithm/leetcode/453/ac453.go function minMoves (line 3) | func minMoves(nums []int) int { FILE: algorithm/leetcode/453/ac453_test.go function Test_minMoves (line 8) | func Test_minMoves(t *testing.T) { FILE: algorithm/leetcode/455/ac455.go function findContentChildren (line 5) | func findContentChildren(g []int, s []int) int { FILE: algorithm/leetcode/455/ac455_test.go function Test_findContentChildren (line 8) | func Test_findContentChildren(t *testing.T) { FILE: algorithm/leetcode/458/ac458.go function poorPigs (line 31) | func poorPigs(buckets int, minutesToDie int, minutesToTest int) int { function mypow (line 39) | func mypow(a, b int) int { FILE: algorithm/leetcode/459/ac459.go function repeatedSubstringPattern (line 5) | func repeatedSubstringPattern(s string) bool { FILE: algorithm/leetcode/459/ac459_test.go function Test_repeatedSubstringPattern (line 8) | func Test_repeatedSubstringPattern(t *testing.T) { FILE: algorithm/leetcode/461/ac461.go function hammingDistance (line 3) | func hammingDistance(x int, y int) int { FILE: algorithm/leetcode/463/ac463.go function islandPerimeter (line 3) | func islandPerimeter(grid [][]int) int { FILE: algorithm/leetcode/463/ac463_test.go function Test_islandPerimeter (line 8) | func Test_islandPerimeter(t *testing.T) { FILE: algorithm/leetcode/475/ac475.go function findRadius (line 5) | func findRadius(houses []int, heaters []int) int { function maxInt (line 19) | func maxInt(a, b int) int { function absInt (line 26) | func absInt(a int) int { FILE: algorithm/leetcode/475/ac475_test.go function Test_findRadius (line 8) | func Test_findRadius(t *testing.T) { FILE: algorithm/leetcode/476/ac476.go function findComplement (line 3) | func findComplement(num int) int { FILE: algorithm/leetcode/476/ac476_test.go function Test_findComplement (line 8) | func Test_findComplement(t *testing.T) { FILE: algorithm/leetcode/479/ac479.go function largestPalindrome (line 8) | func largestPalindrome(n int) int { function reverseInt (line 25) | func reverseInt(a int) string { FILE: algorithm/leetcode/479/ac479_test.go function Test_largestPalindrome (line 8) | func Test_largestPalindrome(t *testing.T) { FILE: algorithm/leetcode/485/ac485.go function findMaxConsecutiveOnes (line 3) | func findMaxConsecutiveOnes(nums []int) int { FILE: algorithm/leetcode/485/ac485_test.go function Test_findMaxConsecutiveOnes (line 8) | func Test_findMaxConsecutiveOnes(t *testing.T) { FILE: algorithm/leetcode/492/ac492.go function constructRectangle (line 5) | func constructRectangle(area int) []int { FILE: algorithm/leetcode/492/ac492_test.go function Test_constructRectangle (line 8) | func Test_constructRectangle(t *testing.T) { FILE: algorithm/leetcode/496/ac496.go function nextGreaterElement (line 3) | func nextGreaterElement(findNums []int, nums []int) []int { function nextMax (line 11) | func nextMax(n int, nums []int) int { FILE: algorithm/leetcode/496/ac496_test.go function Test_nextGreaterElement (line 8) | func Test_nextGreaterElement(t *testing.T) { FILE: algorithm/leetcode/500/ac500.go function findWords (line 5) | func findWords(words []string) []string { FILE: algorithm/leetcode/500/ac500_test.go function Test_findWords (line 8) | func Test_findWords(t *testing.T) { FILE: algorithm/leetcode/501/ac501.go type TreeNode (line 3) | type TreeNode struct function findMode (line 9) | func findMode(root *TreeNode) []int { function traverse (line 20) | func traverse(root *TreeNode, ans *[]int, max, count, pre *int) { FILE: algorithm/leetcode/501/ac501_test.go function Test_findMode (line 8) | func Test_findMode(t *testing.T) { FILE: algorithm/leetcode/504/ac504.go function convertToBase7 (line 7) | func convertToBase7(num int) string { FILE: algorithm/leetcode/504/ac504_test.go function Test_convertToBase7 (line 8) | func Test_convertToBase7(t *testing.T) { FILE: algorithm/leetcode/506/ac506.go type person (line 8) | type person struct type persons (line 13) | type persons method Len (line 16) | func (p persons) Len() int { method Less (line 21) | func (p persons) Less(i, j int) bool { method Swap (line 27) | func (p persons) Swap(i, j int) { function findRelativeRanks (line 31) | func findRelativeRanks(nums []int) []string { FILE: algorithm/leetcode/506/ac506_test.go function Test_findRelativeRanks (line 8) | func Test_findRelativeRanks(t *testing.T) { FILE: algorithm/leetcode/507/ac507.go function checkPerfectNumber (line 5) | func checkPerfectNumber(num int) bool { FILE: algorithm/leetcode/507/ac507_test.go function Test_checkPerfectNumber (line 8) | func Test_checkPerfectNumber(t *testing.T) { FILE: algorithm/leetcode/520/ac520.go function detectCapitalUse (line 3) | func detectCapitalUse(word string) bool { function detectCapitalUse2 (line 37) | func detectCapitalUse2(word string) bool { FILE: algorithm/leetcode/520/ac520_test.go function Test_detectCapitalUse (line 8) | func Test_detectCapitalUse(t *testing.T) { FILE: algorithm/leetcode/521/ac521.go function findLUSlength (line 3) | func findLUSlength(a string, b string) int { FILE: algorithm/leetcode/530/ac530.go type TreeNode (line 5) | type TreeNode struct function getMinimumDifference (line 11) | func getMinimumDifference(root *TreeNode) int { function core (line 21) | func core(root *TreeNode, nums []int) int { function myMin (line 37) | func myMin(a, b int) int { FILE: algorithm/leetcode/530/ac530_test.go function Test_getMinimumDifference (line 8) | func Test_getMinimumDifference(t *testing.T) { FILE: algorithm/leetcode/532/ac532.go function findPairs (line 3) | func findPairs(nums []int, k int) int { FILE: algorithm/leetcode/532/ac532_test.go function Test_findPairs (line 8) | func Test_findPairs(t *testing.T) { FILE: algorithm/leetcode/538/ac538.go type TreeNode (line 3) | type TreeNode struct function convertBST (line 9) | func convertBST(root *TreeNode) *TreeNode { function convertBSTCore (line 19) | func convertBSTCore(root *TreeNode, sums *int) { FILE: algorithm/leetcode/541/ac541.go function reverseStr (line 3) | func reverseStr(s string, k int) string { FILE: algorithm/leetcode/541/ac541_test.go function Test_reverseStr (line 8) | func Test_reverseStr(t *testing.T) { FILE: algorithm/leetcode/543/ac543.go type TreeNode (line 3) | type TreeNode struct function diameterOfBinaryTree (line 11) | func diameterOfBinaryTree(root *TreeNode) int { function depthOfTree (line 26) | func depthOfTree(node *TreeNode, diameter *int) int { function myMax (line 41) | func myMax(a, b int) int { FILE: algorithm/leetcode/551/ac551.go function checkRecord (line 5) | func checkRecord(s string) bool { function checkRecord2 (line 25) | func checkRecord2(s string) bool { FILE: algorithm/leetcode/551/ac551_test.go function Test_checkRecord (line 8) | func Test_checkRecord(t *testing.T) { FILE: algorithm/leetcode/557/ac557.go function reverseWords (line 3) | func reverseWords(s string) string { function reverse (line 19) | func reverse(chars []rune, start, end int) { FILE: algorithm/leetcode/557/ac557_test.go function Test_reverseWords (line 8) | func Test_reverseWords(t *testing.T) { FILE: algorithm/leetcode/561/ac561.go function arrayPairSum (line 5) | func arrayPairSum(nums []int) int { function arrayPairSum2 (line 16) | func arrayPairSum2(nums []int) int { FILE: algorithm/leetcode/561/ac561_test.go function Test_arrayPairSum (line 8) | func Test_arrayPairSum(t *testing.T) { FILE: algorithm/leetcode/563/ac563.go type TreeNode (line 3) | type TreeNode struct function findTilt (line 9) | func findTilt(root *TreeNode) int { function helper (line 15) | func helper(root *TreeNode, ret []int) int { function myAbs (line 27) | func myAbs(a, b int) int { FILE: algorithm/leetcode/566/ac566.go function matrixReshape (line 3) | func matrixReshape(nums [][]int, r int, c int) [][]int { function matrixReshape2 (line 26) | func matrixReshape2(nums [][]int, r int, c int) [][]int { FILE: algorithm/leetcode/566/ac566_test.go function Test_matrixReshape (line 8) | func Test_matrixReshape(t *testing.T) { FILE: algorithm/leetcode/572/ac572.go type TreeNode (line 3) | type TreeNode struct function isSubtree (line 9) | func isSubtree(s *TreeNode, t *TreeNode) bool { function isSame (line 18) | func isSame(t1, t2 *TreeNode) bool { FILE: algorithm/leetcode/575/ac575.go function distributeCandies (line 3) | func distributeCandies(candies []int) int { FILE: algorithm/leetcode/575/ac575_test.go function Test_distributeCandies (line 8) | func Test_distributeCandies(t *testing.T) { FILE: algorithm/leetcode/581/ac581.go function findUnsortedSubarray (line 5) | func findUnsortedSubarray(nums []int) int { function findUnsortedSubarray2 (line 28) | func findUnsortedSubarray2(nums []int) int { function myMax (line 49) | func myMax(a, b int) int { function myMin (line 56) | func myMin(a, b int) int { FILE: algorithm/leetcode/581/ac581_test.go function Test_findUnsortedSubarray (line 8) | func Test_findUnsortedSubarray(t *testing.T) { FILE: algorithm/leetcode/594/ac594.go function findLHS (line 4) | func findLHS(nums []int) int { function myMax (line 19) | func myMax(a, b int) int { FILE: algorithm/leetcode/594/ac594_test.go function Test_findLHS (line 8) | func Test_findLHS(t *testing.T) { FILE: algorithm/leetcode/598/ac598.go function maxCount (line 3) | func maxCount(m int, n int, ops [][]int) int { function myMin (line 16) | func myMin(a, b int) int { FILE: algorithm/leetcode/598/ac598_test.go function Test_maxCount (line 8) | func Test_maxCount(t *testing.T) { FILE: algorithm/leetcode/599/ac599.go function findRestaurant (line 3) | func findRestaurant(list1 []string, list2 []string) []string { FILE: algorithm/leetcode/599/ac599_test.go function Test_findRestaurant (line 8) | func Test_findRestaurant(t *testing.T) { FILE: algorithm/leetcode/605/ac605.go function canPlaceFlowers (line 3) | func canPlaceFlowers(flowerbed []int, n int) bool { FILE: algorithm/leetcode/605/ac605_test.go function Test_canPlaceFlowers (line 8) | func Test_canPlaceFlowers(t *testing.T) { FILE: algorithm/leetcode/606/ac606.go type TreeNode (line 5) | type TreeNode struct function tree2str (line 11) | func tree2str(t *TreeNode) string { FILE: algorithm/leetcode/617/ac617.go type TreeNode (line 3) | type TreeNode struct function mergeTrees (line 9) | func mergeTrees(t1 *TreeNode, t2 *TreeNode) *TreeNode { FILE: algorithm/leetcode/628/ac628.go function maximumProduct (line 8) | func maximumProduct(nums []int) int { function maximumProduct2 (line 30) | func maximumProduct2(nums []int) int { function myMax (line 59) | func myMax(a, b int) int { FILE: algorithm/leetcode/633/ac633.go function judgeSquareSum (line 5) | func judgeSquareSum(c int) bool { FILE: algorithm/leetcode/637/ac637.go type TreeNode (line 3) | type TreeNode struct function averageOfLevels (line 9) | func averageOfLevels(root *TreeNode) []float64 { FILE: algorithm/leetcode/643/ac643.go function findMaxAverage (line 5) | func findMaxAverage(nums []int, k int) float64 { FILE: algorithm/leetcode/643/ac643_test.go function Test_findMaxAverage (line 8) | func Test_findMaxAverage(t *testing.T) { FILE: algorithm/leetcode/645/ac645.go function findErrorNums (line 3) | func findErrorNums(nums []int) []int { function myAbs (line 26) | func myAbs(a int) int { FILE: algorithm/leetcode/645/ac645_test.go function Test_findErrorNums (line 8) | func Test_findErrorNums(t *testing.T) { FILE: algorithm/leetcode/653/ac653.go type TreeNode (line 3) | type TreeNode struct function findTarget (line 9) | func findTarget(root *TreeNode, k int) bool { function dfs (line 18) | func dfs(node *TreeNode, k int, dict map[int]bool) bool { FILE: algorithm/leetcode/653/ac653_test.go function Test_findTarget (line 8) | func Test_findTarget(t *testing.T) { FILE: algorithm/leetcode/657/ac657.go type Position (line 5) | type Position struct function judgeCircle (line 9) | func judgeCircle(moves string) bool { function judgeCircle2 (line 32) | func judgeCircle2(moves string) bool { FILE: algorithm/leetcode/657/ac657_test.go function Test_judgeCircle (line 8) | func Test_judgeCircle(t *testing.T) { FILE: algorithm/leetcode/661/ac661.go function imageSmoother (line 3) | func imageSmoother(M [][]int) [][]int { function smooth (line 20) | func smooth(M [][]int, x, y int) int { FILE: algorithm/leetcode/661/ac661_test.go function Test_imageSmoother (line 8) | func Test_imageSmoother(t *testing.T) { FILE: algorithm/leetcode/665/ac665.go function checkPossibility (line 3) | func checkPossibility(nums []int) bool { FILE: algorithm/leetcode/665/ac665_test.go function Test_checkPossibility (line 8) | func Test_checkPossibility(t *testing.T) { FILE: algorithm/leetcode/669/ac669.go type TreeNode (line 3) | type TreeNode struct function trimBST (line 9) | func trimBST(root *TreeNode, L int, R int) *TreeNode { FILE: algorithm/leetcode/671/ac671.go type TreeNode (line 3) | type TreeNode struct function findSecondMinimumValue (line 9) | func findSecondMinimumValue(root *TreeNode) int { function findCore (line 17) | func findCore(node *TreeNode, min int) int { function myMin (line 34) | func myMin(a, b int) int { function myMax (line 41) | func myMax(a, b int) int { FILE: algorithm/leetcode/671/ac671_test.go function Test_findSecondMinimumValue (line 8) | func Test_findSecondMinimumValue(t *testing.T) { FILE: algorithm/leetcode/674/ac674.go function findLengthOfLCIS (line 3) | func findLengthOfLCIS(nums []int) int { FILE: algorithm/leetcode/674/ac674_test.go function Test_findLengthOfLCIS (line 8) | func Test_findLengthOfLCIS(t *testing.T) { FILE: algorithm/leetcode/680/ac680.go function validPalindrome (line 3) | func validPalindrome(s string) bool { function isPalindromic (line 15) | func isPalindromic(s string, l, r int) bool { FILE: algorithm/leetcode/682/ac682.go function calPoints (line 5) | func calPoints(ops []string) int { FILE: algorithm/leetcode/682/ac682_test.go function Test_calPoints (line 8) | func Test_calPoints(t *testing.T) { FILE: algorithm/leetcode/686/ac686.go function repeatedStringMatch (line 5) | func repeatedStringMatch(A string, B string) int { function repeatedStringMatch2 (line 20) | func repeatedStringMatch2(A string, B string) int { FILE: algorithm/leetcode/686/ac686_test.go function Test_repeatedStringMatch (line 8) | func Test_repeatedStringMatch(t *testing.T) { FILE: algorithm/leetcode/687/ac687.go type TreeNode (line 3) | type TreeNode struct function longestUnivaluePath (line 9) | func longestUnivaluePath(root *TreeNode) int { function dfs (line 17) | func dfs(node *TreeNode, res []int) int { FILE: algorithm/leetcode/693/ac693.go function hasAlternatingBits (line 8) | func hasAlternatingBits(n int) bool { function decimalToBinary (line 20) | func decimalToBinary(n int) []int { function hasAlternatingBits2 (line 33) | func hasAlternatingBits2(n int) bool { FILE: algorithm/leetcode/693/ac693_test.go function Test_hasAlternatingBits2 (line 8) | func Test_hasAlternatingBits2(t *testing.T) { FILE: algorithm/leetcode/695/ac695.go function maxAreaOfIsland (line 3) | func maxAreaOfIsland(grid [][]int) int { function AreaOfIsland (line 18) | func AreaOfIsland(grid [][]int, i, j int) int { FILE: algorithm/leetcode/696/ac696.go function countBinarySubstrings (line 10) | func countBinarySubstrings(s string) int { FILE: algorithm/leetcode/697/ac697.go function findShortestSubArray (line 3) | func findShortestSubArray(nums []int) int { FILE: algorithm/leetcode/717/ac717.go function isOneBitCharacter (line 8) | func isOneBitCharacter(bits []int) bool { FILE: algorithm/leetcode/724/ac724.go function pivotIndex (line 3) | func pivotIndex(nums []int) int { FILE: algorithm/leetcode/728/ac728.go function selfDividingNumbers (line 3) | func selfDividingNumbers(left int, right int) []int { FILE: algorithm/leetcode/744/ac744.go function nextGreatestLetter (line 3) | func nextGreatestLetter(letters []byte, target byte) byte { FILE: algorithm/leetcode/746/ac746.go function minCostClimbingStairs (line 3) | func minCostClimbingStairs(cost []int) int { function myMin (line 10) | func myMin(a, b int) int { FILE: algorithm/leetcode/747/ac747.go function dominantIndex (line 3) | func dominantIndex(nums []int) int { FILE: algorithm/leetcode/747/ac747_test.go function Test_dominantIndex (line 8) | func Test_dominantIndex(t *testing.T) { FILE: algorithm/leetcode/762/ac762.go function countPrimeSetBits (line 3) | func countPrimeSetBits(L, R int) int { FILE: algorithm/leetcode/766/ac766.go function isToeplitzMatrix (line 4) | func isToeplitzMatrix(matrix [][]int) bool { FILE: algorithm/leetcode/766/ac766_test.go function Test_isToeplitzMatrix (line 8) | func Test_isToeplitzMatrix(t *testing.T) { FILE: algorithm/leetcode/771/ac771.go function numJewelsInStones (line 3) | func numJewelsInStones(J string, S string) int { FILE: algorithm/leetcode/771/ac771_test.go function Test_numJewelsInStones (line 8) | func Test_numJewelsInStones(t *testing.T) { FILE: algorithm/leetcode/783/ac783.go type TreeNode (line 5) | type TreeNode struct function minDiffInBST (line 12) | func minDiffInBST(root *TreeNode) int { function check (line 20) | func check(node *TreeNode, nums []int) { function myMin (line 32) | func myMin(a, b int) int { FILE: algorithm/leetcode/783/ac783_test.go function Test_minDiffInBST (line 8) | func Test_minDiffInBST(t *testing.T) { FILE: algorithm/leetcode/784/ac784.go function letterCasePermutation (line 5) | func letterCasePermutation(S string) []string { function core (line 13) | func core(ans []string, chars []byte, index int) []string { function isLetter (line 27) | func isLetter(c byte) bool { function toLower (line 34) | func toLower(c byte) byte { function toUpper (line 42) | func toUpper(c byte) byte { FILE: algorithm/leetcode/784/ac784_test.go function Test_letterCasePermutation (line 8) | func Test_letterCasePermutation(t *testing.T) { FILE: algorithm/leetcode/788/ac788.go function rotatedDigits (line 3) | func rotatedDigits(N int) int { function isValid (line 13) | func isValid(n int) bool { FILE: algorithm/leetcode/796/ac796.go function rotateString (line 6) | func rotateString(A string, B string) bool { FILE: algorithm/leetcode/804/ac804.go function uniqueMorseRepresentations (line 3) | func uniqueMorseRepresentations(words []string) int { FILE: algorithm/leetcode/804/ac804_test.go function Test_uniqueMorseRepresentations (line 8) | func Test_uniqueMorseRepresentations(t *testing.T) { FILE: algorithm/leetcode/811/ac811.go function subdomainVisits (line 8) | func subdomainVisits(cpdomains []string) []string { FILE: algorithm/leetcode/811/ac811_test.go function Test_subdomainVisits (line 8) | func Test_subdomainVisits(t *testing.T) { FILE: algorithm/leetcode/812/ac812.go function largestTriangleArea (line 7) | func largestTriangleArea(points [][]int) float64 { FILE: algorithm/leetcode/812/ac812_test.go function Test_largestTriangleArea (line 8) | func Test_largestTriangleArea(t *testing.T) { FILE: algorithm/leetcode/819/ac819.go function mostCommonWord (line 8) | func mostCommonWord(paragraph string, banned []string) string { function isContain (line 33) | func isContain(words []string, word string) bool { FILE: algorithm/leetcode/819/ac819_test.go function Test_mostCommonWord (line 8) | func Test_mostCommonWord(t *testing.T) { FILE: algorithm/leetcode/821/ac821.go function shortestToChar (line 5) | func shortestToChar(S string, C byte) []int { function getMinDistance (line 26) | func getMinDistance(position []int, p int) int { function myAbs (line 37) | func myAbs(a int) int { FILE: algorithm/leetcode/821/ac821_test.go function Test_shortestToChar (line 8) | func Test_shortestToChar(t *testing.T) { FILE: algorithm/leetcode/824/ac824.go function toGoatLatin (line 8) | func toGoatLatin(S string) string { FILE: algorithm/leetcode/824/ac824_test.go function Test_toGoatLatin (line 8) | func Test_toGoatLatin(t *testing.T) { FILE: algorithm/leetcode/829/ac829.go function consecutiveNumbersSum (line 6) | func consecutiveNumbersSum(N int) int { FILE: algorithm/leetcode/829/ac829_test.go function Test_consecutiveNumbersSum (line 8) | func Test_consecutiveNumbersSum(t *testing.T) { FILE: algorithm/leetcode/830/ac830.go function largeGroupPositions (line 3) | func largeGroupPositions(S string) [][]int { FILE: algorithm/leetcode/830/ac830_test.go function Test_largeGroupPositions (line 8) | func Test_largeGroupPositions(t *testing.T) { FILE: algorithm/leetcode/832/ac832.go function flipAndInvertImage (line 3) | func flipAndInvertImage(A [][]int) [][]int { function reverse (line 11) | func reverse(array []int) { function invert (line 19) | func invert(array []int) { FILE: algorithm/leetcode/836/ac836.go function isRectangleOverlap (line 5) | func isRectangleOverlap(rec1 []int, rec2 []int) bool { FILE: algorithm/leetcode/840/ac840.go function numMagicSquaresInside (line 3) | func numMagicSquaresInside(grid [][]int) int { FILE: algorithm/leetcode/844/ac844.go function backspaceCompare (line 3) | func backspaceCompare(S string, T string) bool { function core (line 13) | func core(s string) string { FILE: algorithm/sfo/30/ac30.go function push (line 13) | func push(number int) { function pop (line 30) | func pop() { function min (line 37) | func min() (int, error) { FILE: algorithm/sfo/30/ac30_test.go function TestOk (line 8) | func TestOk(t *testing.T) { FILE: algorithm/sfo/31/ac31.go function isPopOrder (line 5) | func isPopOrder(pushStack, popStack []int) bool { function Ma (line 38) | func Ma(){ FILE: algorithm/sfo/31/ac31_test.go function Test_isPopOrder (line 8) | func Test_isPopOrder(t *testing.T) { FILE: algorithm/sfo/32/ac32.go type binaryTreeNode (line 8) | type binaryTreeNode struct function breadthFirstSearch (line 14) | func breadthFirstSearch(root *binaryTreeNode) { function breadthFirstSearch2 (line 35) | func breadthFirstSearch2(root *binaryTreeNode) { FILE: algorithm/sfo/32/ac32_test.go function Test_breadthFirstSearch (line 5) | func Test_breadthFirstSearch(t *testing.T) { FILE: algorithm/sfo/33/ac33.go function verifySquenceOfBST (line 4) | func verifySquenceOfBST(sequence []int, begin, end int) bool { FILE: algorithm/sfo/33/ac33_test.go function Test_verifySquenceOfBST (line 8) | func Test_verifySquenceOfBST(t *testing.T) { FILE: algorithm/sfo/34/ac34.go type binaryTreeNode (line 8) | type binaryTreeNode struct function findPath (line 14) | func findPath(root *binaryTreeNode, expectedSum int) { function findPathCore (line 23) | func findPathCore(root *binaryTreeNode, stack *arraystack.Stack, expecte... FILE: algorithm/sfo/34/ac34_test.go function Test_findPath (line 7) | func Test_findPath(t *testing.T) { FILE: algorithm/sfo/35/ac35.go type complexListNode (line 3) | type complexListNode struct function cloneNodes (line 9) | func cloneNodes(head *complexListNode) { function connectSiblingNodes (line 21) | func connectSiblingNodes(head *complexListNode) { function reconnectNodes (line 32) | func reconnectNodes(head *complexListNode) *complexListNode { function clone (line 51) | func clone(pHead *complexListNode) *complexListNode { FILE: algorithm/sfo/36/ac36.go type binaryTreeNode (line 3) | type binaryTreeNode struct function conver (line 8) | func conver(root *binaryTreeNode) *binaryTreeNode { function convertNode (line 20) | func convertNode(node *binaryTreeNode, lastNodeInList **binaryTreeNode) { FILE: algorithm/sfo/36/ac36_test.go function Test_conver (line 8) | func Test_conver(t *testing.T) { FILE: algorithm/sfo/38/ac38.go function permutation (line 5) | func permutation(arrayChar []byte, start int) { function swap (line 23) | func swap(array []byte, m, n int) { FILE: algorithm/sfo/38/ac38_test.go function Test_permutation (line 5) | func Test_permutation(t *testing.T) { FILE: algorithm/sfo/39/ac39.go function moreThanHalfNum (line 3) | func moreThanHalfNum(numbers []int) int { FILE: algorithm/sfo/39/ac39_test.go function Test_moreThanHalfNum (line 8) | func Test_moreThanHalfNum(t *testing.T) { FILE: algorithm/sfo/40/ac40.go function getLeastNumbers (line 5) | func getLeastNumbers(data []int, k int) []int { FILE: algorithm/sfo/40/ac40_test.go function Test_getLeastNumbers (line 8) | func Test_getLeastNumbers(t *testing.T) { FILE: algorithm/sfo/42/ac42.go function findGreatestSumOfSubArray (line 3) | func findGreatestSumOfSubArray(data []int) (int, bool) { FILE: algorithm/sfo/42/ac42_test.go function Test_findGreatestSumOfSubArray (line 8) | func Test_findGreatestSumOfSubArray(t *testing.T) { FILE: algorithm/sfo/43/ac43.go function numberOf1Between1AndN (line 4) | func numberOf1Between1AndN(n int) int { FILE: algorithm/sfo/43/ac43_test.go function Test_numberOf1Between1AndN (line 8) | func Test_numberOf1Between1AndN(t *testing.T) { FILE: algorithm/sfo/44/ac44.go function countOfIntegers (line 5) | func countOfIntegers(digits int) int { function beginNumber (line 12) | func beginNumber(digits int) int { function digitAtIndexCore (line 19) | func digitAtIndexCore(index, digits int) int { function digitAtIndex (line 28) | func digitAtIndex(index int) int { FILE: algorithm/sfo/44/ac44_test.go function Test_digitAtIndex (line 8) | func Test_digitAtIndex(t *testing.T) { FILE: algorithm/sfo/45/ac45.go type intSlice (line 8) | type intSlice method Len (line 10) | func (p intSlice) Len() int { method Less (line 14) | func (p intSlice) Less(i, j int) bool { method Swap (line 18) | func (p intSlice) Swap(i, j int) { function printMinNumber (line 22) | func printMinNumber(numbers []int) string { FILE: algorithm/sfo/45/ac45_test.go function Test_printMinNumber (line 8) | func Test_printMinNumber(t *testing.T) { FILE: algorithm/sfo/46/ac46.go function getTranslation (line 5) | func getTranslation(number int) int { function getTranslationCore (line 12) | func getTranslationCore(str string) int { FILE: algorithm/sfo/46/ac46_test.go function Test_getTranslation (line 8) | func Test_getTranslation(t *testing.T) { FILE: algorithm/sfo/47/ac47.go function getMaxValue (line 3) | func getMaxValue(matrix [][]int) int { function getMaxValue2 (line 36) | func getMaxValue2(matrix [][]int) int { FILE: algorithm/sfo/47/ac47_test.go function Test_getMaxValue (line 8) | func Test_getMaxValue(t *testing.T) { FILE: algorithm/sfo/48/ac48.go function longestSubstring (line 3) | func longestSubstring(str string) int { FILE: algorithm/sfo/48/ac48_test.go function Test_longestSubstring (line 8) | func Test_longestSubstring(t *testing.T) { FILE: algorithm/sfo/49/ac49.go function getUglyNumber (line 3) | func getUglyNumber(index int) int { function min3 (line 30) | func min3(num1, num2, num3 int) int { function min (line 35) | func min(num1, num2 int) int { FILE: algorithm/sfo/49/ac49_test.go function Test_getUglyNumber (line 8) | func Test_getUglyNumber(t *testing.T) { FILE: algorithm/sfo/50/ac50.go function firstNoRepeatingChar (line 3) | func firstNoRepeatingChar(str string) byte { FILE: algorithm/sfo/50/ac50_test.go function Test_firstNoRepeatingChar (line 8) | func Test_firstNoRepeatingChar(t *testing.T) { FILE: algorithm/sfo/51/ac51.go function inversePairs (line 3) | func inversePairs(data []int) int { function inversePairsCore (line 17) | func inversePairsCore(data, copy []int, start, end int) int { FILE: algorithm/sfo/51/ac51_test.go function Test_inversePairs (line 8) | func Test_inversePairs(t *testing.T) { FILE: algorithm/sfo/52/ac52.go type ListNode (line 3) | type ListNode struct function findFirstCommonNode (line 8) | func findFirstCommonNode(head1, head2 *ListNode) *ListNode { function getListLength (line 34) | func getListLength(head *ListNode) int { FILE: algorithm/sfo/52/ac52_test.go function Test_findFirstCommonNode (line 8) | func Test_findFirstCommonNode(t *testing.T) { FILE: algorithm/sfo/53/ac53.go function getFirstK (line 3) | func getFirstK(numbers []int, k, start, end int) int { function getLastK (line 24) | func getLastK(numbers []int, k, start, end int) int { function getNumberOfK (line 45) | func getNumberOfK(numbers []int, k int) int { function getMissingNumber (line 57) | func getMissingNumber(numbers []int) int { function getNumberSameAsIndex (line 79) | func getNumberSameAsIndex(numbers []int) int { FILE: algorithm/sfo/53/ac53_test.go function Test_getNumberOfK (line 8) | func Test_getNumberOfK(t *testing.T) { FILE: algorithm/sfo/54/ac54.go type BinaryTreeNode (line 3) | type BinaryTreeNode struct function kthNode (line 8) | func kthNode(root *BinaryTreeNode, k int) *BinaryTreeNode { FILE: algorithm/sfo/55/ac55.go type BinaryTreeNode (line 3) | type BinaryTreeNode struct function treeDepth (line 8) | func treeDepth(root *BinaryTreeNode) int { function isBalanced (line 21) | func isBalanced(root *BinaryTreeNode, depth *int) bool { function isBalance (line 41) | func isBalance(root *BinaryTreeNode) bool { FILE: algorithm/sfo/55/ac55_test.go function Test_treeDepth (line 8) | func Test_treeDepth(t *testing.T) { FILE: algorithm/sfo/56/ac56.go function findNumbersAppearOnce (line 8) | func findNumbersAppearOnce(data []int) (int, int) { function findFirstBitIs1 (line 29) | func findFirstBitIs1(num int) uint { function isBit1 (line 38) | func isBit1(num int, indexBit uint) bool { function findNumberAppearOnce2 (line 46) | func findNumberAppearOnce2(numbers []int) int { FILE: algorithm/sfo/56/ac56_test.go function Test_findNumbersAppearOnce (line 8) | func Test_findNumbersAppearOnce(t *testing.T) { FILE: algorithm/sfo/57/ac57.go function findNumbers (line 5) | func findNumbers(data []int, sum int) (int, int, bool) { function findContinuousSequence (line 26) | func findContinuousSequence(sum int) { function printContinuousSequence (line 52) | func printContinuousSequence(small, big int) { FILE: algorithm/sfo/57/ac57_test.go function Test_findNumbers (line 8) | func Test_findNumbers(t *testing.T) { FILE: algorithm/sfo/58/ac58.go function reverse (line 3) | func reverse(str []rune) { function reverseSentence (line 14) | func reverseSentence(str string) string { function leftRotateString (line 40) | func leftRotateString(str string, n int) string { FILE: algorithm/sfo/58/ac58_test.go function Test_reverseSentence (line 8) | func Test_reverseSentence(t *testing.T) { function Test_leftRotateString (line 14) | func Test_leftRotateString(t *testing.T) { FILE: algorithm/sfo/59/ac59.go function maxInWindows (line 7) | func maxInWindows(num []int, size int) []int { FILE: algorithm/sfo/59/ac59_test.go function Test_maxInWindows (line 8) | func Test_maxInWindows(t *testing.T) { FILE: algorithm/sfo/61/ac60.go function isContinuous (line 5) | func isContinuous(numbers []int) bool { FILE: algorithm/sfo/61/ac60_test.go function Test_isContinuous (line 8) | func Test_isContinuous(t *testing.T) { FILE: algorithm/sfo/62/ac62.go function lastRemaining (line 3) | func lastRemaining(n, m int) int { FILE: algorithm/sfo/62/ac62_test.go function Test_lastRemaining (line 8) | func Test_lastRemaining(t *testing.T) { FILE: algorithm/sfo/63/ac63.go function maxDiff (line 3) | func maxDiff(numbers []int) int { FILE: algorithm/sfo/63/ac63_test.go function Test_maxDiff (line 8) | func Test_maxDiff(t *testing.T) { FILE: algorithm/sfo/65/ac64.go function Add (line 3) | func Add(num1, num2 int) int { FILE: algorithm/sfo/65/ac64_test.go function TestAdd (line 8) | func TestAdd(t *testing.T) { FILE: lib/BinaryTreeNode.go type BinaryTreeNode (line 3) | type BinaryTreeNode struct FILE: lib/GetLine.go function GetLine (line 9) | func GetLine() string { FILE: lib/Reverse.go function Reverse (line 3) | func Reverse(data []interface{}) { FILE: lib/grpool/Pool.go type Pool (line 7) | type Pool struct method Add (line 22) | func (p *Pool) Add(delta int) { method Done (line 32) | func (p *Pool) Done() { method WaitAll (line 37) | func (p *Pool) WaitAll() { function New (line 12) | func New(size int) *Pool { FILE: notes/defer/main.go function main (line 10) | func main() { FILE: notes/learn/main.go function main (line 9) | func main() { function f2 (line 32) | func f2(text string) { function f1 (line 39) | func f1(arg int) (int, error) { function modify (line 47) | func modify(slice []int) { function test (line 52) | func test(a, b int, c float64) { function testMap (line 56) | func testMap() { function testArray (line 70) | func testArray() { function IsEven (line 83) | func IsEven(number int) bool { function IsEven2 (line 91) | func IsEven2(number int) bool { function testEven (line 99) | func testEven() { FILE: notes/main/main.go function main (line 7) | func main() { FILE: notes/nil/main.go function main (line 7) | func main() { FILE: notes/switch/main.go function main (line 12) | func main() { function test (line 35) | func test(x float64) { function test2 (line 47) | func test2() { FILE: notes/time/main.go function main (line 8) | func main() { FILE: notes/函数/main.go function main (line 6) | func main() { function Add (line 16) | func Add(x int, y int) int { function add (line 20) | func add(x int, y int, z int) int { function add2 (line 24) | func add2(x, y, z int) int { function add3 (line 28) | func add3(x bool, y, z int) (bool, int) { function swap (line 32) | func swap(x, y string) (string, string) { function split (line 41) | func split(sum int) (x, y int) { FILE: notes/判断/main.go function main (line 8) | func main() { function myPow (line 16) | func myPow(x, y, ans float64) float64 { function Sqrt (line 26) | func Sqrt(x float64) float64 { FILE: notes/协程/main.go function main (line 10) | func main() { function lowwerCase (line 54) | func lowwerCase(id int, group *grpool.Pool) { function upperCase (line 66) | func upperCase(id int, group *grpool.Pool) { FILE: notes/变量/main.go function main (line 8) | func main() { FILE: notes/命令行参数/iie.go function usage (line 9) | func usage() { function main (line 23) | func main() { FILE: notes/导入导出/main.go function main (line 11) | func main() { FILE: notes/常量/main.go constant PI (line 9) | PI = 3.1415926 function main (line 11) | func main(){ FILE: notes/循环/main.go function main (line 5) | func main() { FILE: notes/数组/main.go type Currency (line 5) | type Currency constant USD (line 9) | USD Currency = iota constant EUR (line 11) | EUR constant GBP (line 15) | GBP constant RMB (line 19) | RMB function main (line 25) | func main() { FILE: notes/输入/main.go function main (line 11) | func main() { FILE: notes/输出/main.go function main (line 100) | func main() { function learnScan (line 104) | func learnScan(){ function learnPrintf (line 119) | func learnPrintf(){