{"type":"doc","content":[{"type":"extension","attrs":{"layout":"default","extensionType":"com.atlassian.confluence.macro.core","extensionKey":"toc","parameters":{"macroParams":{"style":{"value":"none"}},"macroMetadata":{"macroId":{"value":"fdda5d5c-1446-4096-89f6-4aa9286631e6"},"schemaVersion":{"value":"1"},"title":"Table of Contents"}},"localId":"a505ce43-35e3-4a62-83f4-3b7520e9066f"}},{"type":"heading","attrs":{"level":2},"content":[{"text":"遍历二维数组","type":"text"}]},{"type":"heading","attrs":{"level":3},"content":[{"text":"LC 151. Reverse Words in a String 反转字符串中的单词","type":"text"}]},{"type":"paragraph","content":[{"type":"inlineCard","attrs":{"url":"https://leetcode.com/problems/reverse-words-in-a-string/"}},{"text":" ","type":"text"}]},{"type":"codeBlock","attrs":{"language":"go"},"content":[{"text":"func reverseWords(s string) string {\n words := strings.Fields(s)\n slices.Reverse(words)\n return strings.Join(words, \" \")\n}","type":"text"}]},{"type":"paragraph","content":[{"text":"原地解法","type":"text","marks":[{"type":"strong"}]}]},{"type":"paragraph","content":[{"type":"status","attrs":{"color":"purple","style":"bold","text":"待复习","localId":"3f120094-f8d4-4f49-98c0-e2c9114c893c"}},{"text":" ","type":"text"}]},{"type":"codeBlock","attrs":{"language":"c++"},"content":[{"text":"class Solution {\npublic:\n string reverseWords(string s) {\n removeExtraSpaces(s);\n \n reverse(s.begin(), s.end());\n\n string::iterator gh = s.begin();\n for (auto p = s.begin(); p != s.end(); p++) {\n if (*p == ' ') {\n reverse(gh, p);\n gh = p+1;\n continue;\n }\n }\n reverse(gh, s.end());\n\n return s;\n }\n\n void removeExtraSpaces(string& s) {\n int slow = 0;\n int fast = 0;\n \n while (fast < s.size() && s[fast] == ' ') {\n fast++;\n }\n \n bool isSpace = false; // 标记前一个字符是否为空格\n while (fast < s.size()) {\n if (s[fast] == ' ') {\n if (!isSpace) { // 当前是空格，且前一个不是空格\n s[slow++] = ' ';\n isSpace = true;\n }\n } else { // 非空格字符\n s[slow++] = s[fast];\n isSpace = false;\n }\n fast++;\n }\n \n if (slow > 0 && s[slow - 1] == ' ') {\n slow--;\n }\n \n s.resize(slow);\n }\n\n \n};","type":"text"}]},{"type":"heading","attrs":{"level":3},"content":[{"text":"LC 48. Rotate Image 旋转图像","type":"text"}]},{"type":"paragraph","content":[{"type":"inlineCard","attrs":{"url":"https://leetcode.com/problems/rotate-image/description/"}},{"text":" ","type":"text"}]},{"type":"paragraph","content":[{"type":"status","attrs":{"color":"purple","style":"bold","text":"待复习","localId":"e269789c-7637-4e61-8114-c6013c4dbf44"}},{"text":" ","type":"text"}]},{"type":"codeBlock","attrs":{"language":"go"},"content":[{"text":"func rotate(matrix [][]int) {\n n := len(matrix)\n for i := 0; i < n; i++ {\n for j := 0; j < i; j++ {\n matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]\n }\n }\n\n for i := 0; i < n; i++ {\n slices.Reverse(matrix[i])\n }\n}","type":"text"}]},{"type":"heading","attrs":{"level":3},"content":[{"text":"逆时针旋转图像","type":"text"}]},{"type":"paragraph","content":[{"text":"与 LC 48 类似，但从顺时针旋转 90 度改成逆时针旋转 90 度","type":"text"}]},{"type":"paragraph","content":[{"type":"status","attrs":{"color":"purple","style":"bold","text":"待复习","localId":"9c110e1b-bb4f-46c8-a6e5-9964e7436dad"}},{"text":" ","type":"text"}]},{"type":"codeBlock","content":[{"text":"func rotate(matrix [][]int) {\n n := len(matrix)\n for i := 0; i < n; i++ {\n for j := 0; j < n-i-1; j++ {\n matrix[i][j], matrix[n-j-1][n-i-1] = matrix[n-j-1][n-i-1], matrix[i][j]\n }\n }\n\n for i := 0; i < n; i++ {\n slices.Reverse(matrix[i])\n }\n}","type":"text"}]},{"type":"heading","attrs":{"level":3},"content":[{"text":"LC 54. Spiral Matrix 螺旋矩阵","type":"text"}]},{"type":"paragraph","content":[{"type":"inlineCard","attrs":{"url":"https://leetcode.com/problems/spiral-matrix/description/"}},{"text":" ","type":"text"}]},{"type":"paragraph","content":[{"type":"status","attrs":{"color":"purple","style":"bold","text":"待复习","localId":"b68098f5-5b3a-400c-8f81-8e7d14d3af44"}}]},{"type":"codeBlock","attrs":{"language":"go"},"content":[{"text":"func spiralOrder(matrix [][]int) []int {\n m, n := len(matrix), len(matrix[0]) // matrix: m rows * n cols\n total := m * n\n \n T := 0\n B := m-1\n L := 0\n R := n-1\n\n result := make([]int, 0, total)\n\n for len(result) < total {\n // top\n if T <= B {\n i := T\n for j := L; j <= R; j++ {\n result = append(result, matrix[i][j])\n }\n T++\n }\n\n // right\n if L <= R {\n j := R\n for i := T; i <= B; i++ {\n result = append(result, matrix[i][j])\n }\n R--\n }\n \n // bottom\n if T <= B {\n i := B\n for j := R; j >= L; j-- {\n result = append(result, matrix[i][j])\n }\n B--\n }\n \n // left\n if L <= R {\n j := L\n for i := B; i >= T; i-- {\n result = append(result, matrix[i][j])\n }\n L++\n }\n }\n\n return result\n}","type":"text"}]},{"type":"heading","attrs":{"level":3},"content":[{"text":"LC 59. Spiral Matrix II 螺旋矩阵 II","type":"text"}]},{"type":"paragraph","content":[{"text":"https://leetcode.com/problems/spiral-matrix-ii/description/","type":"text","marks":[{"type":"link","attrs":{"href":"https://leetcode.com/problems/spiral-matrix-ii/description/"}}]}]},{"type":"codeBlock","attrs":{"language":"go"},"content":[{"text":"func generateMatrix(n int) [][]int {\n T := 0\n B := n-1\n L := 0\n R := n-1\n\n matrix := createMatrix(n)\n\n x := 1\n total := n*n\n\n for x <= total {\n // top\n if T <= B {\n i := T\n for j := L; j <= R; j++ {\n matrix[i][j] = x\n x++\n }\n T++\n }\n\n // right\n if L <= R {\n j := R\n for i := T; i <= B; i++ {\n matrix[i][j] = x\n x++\n }\n R--\n }\n\n // bottom\n if T <= B {\n i := B\n for j := R; j >= L; j-- {\n matrix[i][j] = x\n x++\n }\n B--\n }\n\n // left\n if L <= R {\n j := L\n for i := B; i >= T; i-- {\n matrix[i][j] = x\n x++\n }\n L++\n }\n }\n\n return matrix\n}\n\nfunc createMatrix(n int) [][]int {\n matrix := make([][]int, n)\n for i := range matrix {\n matrix[i] = make([]int, n)\n }\n return matrix\n}","type":"text"}]},{"type":"heading","attrs":{"level":2},"content":[{"text":"双指针数组","type":"text"}]},{"type":"heading","attrs":{"level":3},"content":[{"text":"LC 125. Valid Palindrome 验证回文串","type":"text"}]},{"type":"codeBlock","attrs":{"language":"go"},"content":[{"text":"func isPalindrome(s string) bool {\n i, j := -1, len(s)\n\n for {\n i++\n j--\n\n for i < j && !isValid(s[i]) { i++ }\n for i < j && !isValid(s[j]) { j-- }\n\n if i >= j {\n break\n }\n\n if !equal(s[i], s[j]) {\n return false\n }\n }\n\n return true\n}\n\nfunc isValid(c byte) bool {\n return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')\n}\n\nfunc equal(a, b byte) bool {\n return a == b || lower(a) == lower(b)\n}\n\nfunc lower(b byte) byte {\n if b >= 'A' && b <= 'Z' {\n return b - 'A' + 'a'\n }\n\n return b\n}","type":"text"}]},{"type":"paragraph"}],"version":1}

Browser not supported