{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":621921550,"defaultBranch":"master","name":"my-learn-algorithm","ownerLogin":"Albert26193","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-03-31T17:20:36.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/56572585?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1680283257.0","currentOid":""},"activityList":{"items":[{"before":"0557933d0c91892cef32d28665d98634e690bf52","after":"4946ac9ec481675f47c05c910df2702e2836f529","ref":"refs/heads/master","pushedAt":"2024-09-18T16:27:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"chore: Update lc package name and dependencies","shortMessageHtmlLink":"chore: Update lc package name and dependencies"}},{"before":"10c108275e1ba740b51bc6a8acb68906985b309b","after":"0557933d0c91892cef32d28665d98634e690bf52","ref":"refs/heads/master","pushedAt":"2024-09-16T22:25:24.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"chore(rust): update project name and file structure","shortMessageHtmlLink":"chore(rust): update project name and file structure"}},{"before":"18144afc0a2c32559da8785ae2177c1d99632480","after":"10c108275e1ba740b51bc6a8acb68906985b309b","ref":"refs/heads/master","pushedAt":"2024-09-15T18:06:56.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"update","shortMessageHtmlLink":"update"}},{"before":"3d8359917206f21cf66eeb2b0ebd9d26ea6b14ef","after":"18144afc0a2c32559da8785ae2177c1d99632480","ref":"refs/heads/master","pushedAt":"2024-09-15T18:03:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"update","shortMessageHtmlLink":"update"}},{"before":"20bd1af29f986b06549ee8af591c5da73b8c6fbd","after":"3d8359917206f21cf66eeb2b0ebd9d26ea6b14ef","ref":"refs/heads/master","pushedAt":"2024-06-04T15:55:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat: Add solution for problem 1953","shortMessageHtmlLink":"feat: Add solution for problem 1953"}},{"before":"c88f3dc757b8621af1363c690647472f7ec2a531","after":"20bd1af29f986b06549ee8af591c5da73b8c6fbd","ref":"refs/heads/master","pushedAt":"2024-05-16T06:39:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"fix(solution.go): optimize check function in restore-ip-addresses to improve performance\nfeat(solution.go): add solution for 2079.watering-plants problem in leetcode\nfeat(testcases.txt): add test cases for 2079.watering-plants problem in leetcode","shortMessageHtmlLink":"fix(solution.go): optimize check function in restore-ip-addresses to …"}},{"before":"cf7dff7db3489704cb8befeb06069eebe79c278f","after":"c88f3dc757b8621af1363c690647472f7ec2a531","ref":"refs/heads/master","pushedAt":"2024-05-08T13:56:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat: add new problems","shortMessageHtmlLink":"feat: add new problems"}},{"before":"ded722f77726ee4dbca2a1f473140e95d1d8c234","after":"cf7dff7db3489704cb8befeb06069eebe79c278f","ref":"refs/heads/master","pushedAt":"2024-03-10T12:18:50.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat: add new solutions","shortMessageHtmlLink":"feat: add new solutions"}},{"before":"4401ac039c350f9e03aacf4f8e5d0767abeae8f5","after":"ded722f77726ee4dbca2a1f473140e95d1d8c234","ref":"refs/heads/master","pushedAt":"2024-03-07T05:26:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"791474dd843b3a6298233d77b89ba5d53055f0d1","after":"4401ac039c350f9e03aacf4f8e5d0767abeae8f5","ref":"refs/heads/master","pushedAt":"2024-03-06T05:53:33.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat: update goroutine","shortMessageHtmlLink":"feat: update goroutine"}},{"before":"451ac45dbc8200bf41e70e49ebf4376dd482a954","after":"791474dd843b3a6298233d77b89ba5d53055f0d1","ref":"refs/heads/master","pushedAt":"2024-03-03T11:56:27.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat: update lc56","shortMessageHtmlLink":"feat: update lc56"}},{"before":"615c12b274811d6765fa6e3c180f82ff7d4f53c4","after":"451ac45dbc8200bf41e70e49ebf4376dd482a954","ref":"refs/heads/master","pushedAt":"2024-03-03T07:57:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"update solutions","shortMessageHtmlLink":"update solutions"}},{"before":"2032218c2bbafca40dd128f9be8055f2700d9683","after":"615c12b274811d6765fa6e3c180f82ff7d4f53c4","ref":"refs/heads/master","pushedAt":"2024-03-02T16:27:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat: add new solutions","shortMessageHtmlLink":"feat: add new solutions"}},{"before":"d4cf0d5380ad419b15dca08e1ef6b14cf9084288","after":"2032218c2bbafca40dd128f9be8055f2700d9683","ref":"refs/heads/master","pushedAt":"2024-02-24T06:26:42.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"chore(go.work): add new go modules for interview and misc\nchore(go.work.sum): add testify v1.8.1 as a dependency\nchore(solution.go): add TODO comment to revisit the solution and extract a function for checking array range validity\nfeat(leetgo.yaml): add leetgo project level configuration file with language set to zh and go as the code language\nfeat(go/misc/go.mod): add go.mod file for the misc module\nfeat(go/newcoder/go.mod): add go.mod file for the newcoder module","shortMessageHtmlLink":"chore(go.work): add new go modules for interview and misc"}},{"before":"22e90f3253e042caa7f621b667cb96c0bff74ab6","after":"d4cf0d5380ad419b15dca08e1ef6b14cf9084288","ref":"refs/heads/master","pushedAt":"2024-02-23T06:58:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat: update solutions","shortMessageHtmlLink":"feat: update solutions"}},{"before":"e86c0450027625dc1fc6414f7ec0b3a284bea782","after":"22e90f3253e042caa7f621b667cb96c0bff74ab6","ref":"refs/heads/master","pushedAt":"2024-02-20T18:23:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(reverse-nodes-in-k-group): add solution and test cases for reversing nodes in k-group problem\nfeat(reverse-linked-list): add solution and test cases for reversing a linked list problem","shortMessageHtmlLink":"feat(reverse-nodes-in-k-group): add solution and test cases for rever…"}},{"before":"f9c9f2115dc1f95a8445266ab91a7303698606fb","after":"e86c0450027625dc1fc6414f7ec0b3a284bea782","ref":"refs/heads/master","pushedAt":"2024-02-20T10:25:13.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/0140.word-break-ii): add solution for problem 140 - Word Break II\n\nThis commit adds a solution for the problem 140 - Word Break II on LeetCode. The problem requires constructing sentences by adding spaces to a given string, such that all the words in the sentence are present in a given word dictionary. The solution uses a depth-first search (DFS) approach to generate all possible combinations of words that can be formed from the given string and word dictionary.\n\nThe commit includes the following changes:\n- Added the solution.go file, which contains the implementation of the wordBreak function.\n- Created the testcases.txt file, which includes test cases for the problem.\n- Updated the lc-0140.md file, which provides the problem description and examples.\n\nThe solution.go file defines the wordBreak function, which takes a string s and a word dictionary as input and returns a slice of strings representing all possible sentences that can be formed from the given string and word dictionary. The function uses a DFS approach to generate all possible combinations of words and stores them in the ans variable. Finally, it converts the combinations into strings and returns the result.\n\nThe main function in solution.go reads the test cases from the testcases.txt file, calls the wordBreak function with the input, and prints the output.\n\nThe commit message follows the conventional commit format and provides a clear and concise description of the changes made in this commit.","shortMessageHtmlLink":"feat(leetcode/go/0140.word-break-ii): add solution for problem 140 - …"}},{"before":"a9a4b6fabd2d9d87ff0f7d67cfd3f6f34d62124e","after":"f9c9f2115dc1f95a8445266ab91a7303698606fb","ref":"refs/heads/master","pushedAt":"2024-02-20T09:30:45.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(reorder-list): implement the algorithm to reorder a singly linked list\n\nThis commit adds the implementation of the `reorderList` function in the `solution.go` file. The function takes a singly linked list as input and reorders it according to the specified rules. The algorithm consists of the following steps:\n\n1. Find the middle node of the linked list.\n2. Split the linked list into two halves at the middle node.\n3. Reverse the second half of the linked list.\n4. Join the two halves by alternating nodes from each half.\n\nThe `reorderList` function uses helper functions `findMiddleNode`, `reverseList`, and `joinList` to perform these steps. The function also includes test cases from the `testcases.txt` file to validate the implementation.\n\nThis implementation allows the linked list to be reordered in-place, without changing the values of the nodes. The commit also includes the necessary imports and variable declarations for the solution.\n\nThe purpose of this change is to provide a solution for the \"Reorder List\" problem on LeetCode, which requires reordering a linked list according to a specific pattern.","shortMessageHtmlLink":"feat(reorder-list): implement the algorithm to reorder a singly linke…"}},{"before":"ec2db91e0d21d5a46121f368ee859a36e91516d2","after":"a9a4b6fabd2d9d87ff0f7d67cfd3f6f34d62124e","ref":"refs/heads/master","pushedAt":"2024-02-16T13:02:34.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/0085.maximal-rectangle): add solution for the problem \"最大矩形\" (Hard)\n\nThis commit adds the solution for the problem \"最大矩形\" on LeetCode. The problem involves finding the largest rectangle in a binary matrix that consists of only 0s and 1s. The solution uses dynamic programming to calculate the heights of the rectangles at each position and then calculates the maximum area using a stack-based approach.\n\nfeat(leetcode/go/0124.binary-tree-maximum-path-sum): add solution for the problem \"二叉树中的最大路径和\" (Hard)\n\nThis commit adds the solution for the problem \"二叉树中的最大路径和\" on LeetCode. The problem involves finding the maximum path sum in a binary tree. The solution uses a recursive approach to calculate the maximum path sum for each node, considering both left and right subtrees. The maximum path sum is updated at each node, and the final result is returned.\n\nfeat(leetcode/go/0300.longest-increasing-subsequence): add solution for the problem \"最长递增子序列\" (Medium)\n\nThis commit adds the solution for the problem \"最长递增子序列\" on LeetCode. The problem involves finding the length of the longest increasing subsequence in an integer array. The solution uses a greedy algorithm combined with binary search to efficiently find the longest increasing subsequence. The time complexity of the solution is O(n log(n)).","shortMessageHtmlLink":"feat(leetcode/go/0085.maximal-rectangle): add solution for the proble…"}},{"before":"d2ca82a7dae1e724e32c012eca0e5ab958231c47","after":"ec2db91e0d21d5a46121f368ee859a36e91516d2","ref":"refs/heads/master","pushedAt":"2024-02-14T02:11:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(go): update go interview input and test demo","shortMessageHtmlLink":"feat(go): update go interview input and test demo"}},{"before":"6474d870425fc99cae60df3ba77f0f77ecd22304","after":"d2ca82a7dae1e724e32c012eca0e5ab958231c47","ref":"refs/heads/master","pushedAt":"2024-01-24T02:39:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"add 2866","shortMessageHtmlLink":"add 2866"}},{"before":"d6e5f387428b55b6214a766cd0e0840c7e462d16","after":"6474d870425fc99cae60df3ba77f0f77ecd22304","ref":"refs/heads/master","pushedAt":"2024-01-24T01:31:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/2865.beautiful-towers-i): add solution for problem 2865 \"美丽塔 I\"\n\nThis commit adds a solution for problem 2865 \"美丽塔 I\" on LeetCode. The problem involves building towers on a coordinate axis based on given constraints. The goal is to find the maximum sum of heights for a set of towers that satisfy certain conditions.\n\nThe solution is implemented in the `solution.go` file. It defines a function `maximumSumOfHeights` that takes an array of maximum heights as input and returns the maximum sum of heights. The function iterates over each tower and calculates the maximum sum by considering the heights of neighboring towers.\n\nThe solution uses two helper functions, `minn` and `maxx`, to find the minimum and maximum values respectively. These functions are used to update the heights of neighboring towers.\n\nThe `testcases.txt` file contains test cases for the problem, and the `main` function in `solution.go` reads the test cases from the file and outputs the results.\n\nThe solution has been tested and produces the correct output for the provided test cases.","shortMessageHtmlLink":"feat(leetcode/go/2865.beautiful-towers-i): add solution for problem 2…"}},{"before":"dfe87d90a89970bc1688648f222a1df3ca125a52","after":"d6e5f387428b55b6214a766cd0e0840c7e462d16","ref":"refs/heads/master","pushedAt":"2024-01-22T06:07:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/0073.set-matrix-zeroes): add solution for the problem \"73. 矩阵置零\"\n\nThis commit adds a solution for the problem \"73. 矩阵置零\" on LeetCode. The problem requires us to modify a given matrix in-place, setting the entire row and column to zero if any element in the matrix is zero.\n\nThe solution is implemented in the `setZeroes` function. It iterates through the matrix and records the rows and columns that need to be set to zero using two boolean variables `recRow` and `recCol`. Then, it uses the first row and first column of the matrix as flags to mark the rows and columns that need to be set to zero. Finally, it updates the matrix based on the flags.\n\nThe commit also includes a test case file `testcases.txt` and a main function to read the test cases, call the `setZeroes` function, and print the output.\n\nThe solution has a time complexity of O(m * n), where m and n are the dimensions of the matrix.","shortMessageHtmlLink":"feat(leetcode/go/0073.set-matrix-zeroes): add solution for the proble…"}},{"before":"fb85c2194f15a69986da6951f40c1ba9404f7274","after":"dfe87d90a89970bc1688648f222a1df3ca125a52","ref":"refs/heads/master","pushedAt":"2024-01-22T05:44:16.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"fix(solution.go): refactor trap function to improve readability and performance\nfix(solution.go): change variable name from stdin to in for consistency\nfix(solution.go): change file open mode from os.Stdin to \"./testcases.txt\" for proper input handling","shortMessageHtmlLink":"fix(solution.go): refactor trap function to improve readability and p…"}},{"before":"24a8acac21cb5b14d036f802e8af876a3b0d670c","after":"fb85c2194f15a69986da6951f40c1ba9404f7274","ref":"refs/heads/master","pushedAt":"2024-01-21T13:51:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/1011.capacity-to-ship-packages-within-d-days): add solution for problem 1011\n\nThis commit adds a solution for the problem 1011 \"Capacity To Ship Packages Within D Days\" on LeetCode. The problem involves finding the minimum capacity of a ship required to transport packages within a given number of days.\n\nThe commit includes the following changes:\n- Added the solution.go file, which contains the implementation of the shipWithinDays function.\n- Implemented the shipWithinDays function, which calculates the minimum capacity of the ship using a binary search algorithm.\n- Added the maxx function, which returns the maximum value from a given set of numbers.\n- Created the testcases.txt file, which contains test cases for the problem.\n- Updated the lc-1011.md file, which provides a description of the problem and examples.\n\nThe solution.go file includes comments explaining the code logic and the main function for running the test cases.","shortMessageHtmlLink":"feat(leetcode/go/1011.capacity-to-ship-packages-within-d-days): add s…"}},{"before":"5de10566920078cdb9d7feb4f6ca9bfaf11e2941","after":"24a8acac21cb5b14d036f802e8af876a3b0d670c","ref":"refs/heads/master","pushedAt":"2024-01-20T16:44:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"chore(acw901.go): remove unused file acw901.go and testcase.txt\n\nfeat(lc-0990.md): add problem description and examples for LeetCode problem 990 \"Satisfiability of Equality Equations\"\n\nfeat(solution.go): implement solution for LeetCode problem 990 \"Satisfiability of Equality Equations\"\n\nfeat(testcases.txt): add test cases for LeetCode problem 990 \"Satisfiability of Equality Equations\"","shortMessageHtmlLink":"chore(acw901.go): remove unused file acw901.go and testcase.txt"}},{"before":"b58946592e359956c32436babefe9b4bd9a31bb8","after":"5de10566920078cdb9d7feb4f6ca9bfaf11e2941","ref":"refs/heads/master","pushedAt":"2024-01-20T14:19:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(acw901): add solution for ACW901 problem in Go\n\nThis commit adds the solution for the ACW901 problem in Go. The solution is implemented in the `acw901.go` file. The solution reads input from the `testcase.txt` file and calculates the maximum length of a path in a grid. It uses a depth-first search (DFS) algorithm to traverse the grid and update the maximum length of each cell. The final result is printed as the output.\n\nfeat(lc-0839): add solution for LeetCode problem 839 in Go\n\nThis commit adds the solution for the LeetCode problem 839 in Go. The solution is implemented in the `solution.go` file. The solution reads input from the `testcases.txt` file and calculates the number of similar string groups. It uses a union-find data structure to merge similar strings and count the number of distinct groups. The final result is printed as the output.","shortMessageHtmlLink":"feat(acw901): add solution for ACW901 problem in Go"}},{"before":"f17e5d4c1ed7d9fc92d17e79bf169a80ecdf7fde","after":"b58946592e359956c32436babefe9b4bd9a31bb8","ref":"refs/heads/master","pushedAt":"2024-01-16T14:45:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/0947.most-stones-removed-with-same-row-or-column): add solution for problem 947 - \"Remove Most Stones with Same Row or Column\"","shortMessageHtmlLink":"feat(leetcode/go/0947.most-stones-removed-with-same-row-or-column): a…"}},{"before":"2294f89825079a7db0517254fe151d1c0bd21651","after":"f17e5d4c1ed7d9fc92d17e79bf169a80ecdf7fde","ref":"refs/heads/master","pushedAt":"2024-01-14T08:08:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/0494.target-sum): add solution for the \"494. 目标和\" problem\n\nThis commit adds the solution for the \"494. 目标和\" problem on LeetCode. The problem involves finding the number of different expressions that can be constructed by adding '+' or '-' symbols in front of each integer in the given non-negative integer array `nums`, and concatenating them, such that the resulting expression evaluates to the given target integer.\n\nThe solution is implemented in the `findTargetSumWays` function in the `solution.go` file. It uses dynamic programming to calculate the number of ways to reach each possible sum. The algorithm iterates over the array of integers and updates the count of ways to reach each sum by considering the current integer. Finally, it returns the count of ways to reach the target sum.\n\nThe commit also includes a test case file `testcases.txt` that contains input and output examples for the problem. The `main` function in `solution.go` reads the test cases from the file and outputs the results.\n\nExample test cases are included in the `testcases.txt` file, and the solution produces the expected outputs for those test cases.","shortMessageHtmlLink":"feat(leetcode/go/0494.target-sum): add solution for the \"494. 目标和\" pr…"}},{"before":"588e066958b242ee5d23815784e291fff5d97f0d","after":"2294f89825079a7db0517254fe151d1c0bd21651","ref":"refs/heads/master","pushedAt":"2024-01-14T07:42:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert26193","name":"Albert26193","path":"/Albert26193","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/56572585?s=80&v=4"},"commit":{"message":"feat(leetcode/go/0468.validate-ip-address): add solution for validating IP addresses\n\nThis commit adds a solution for the problem \"468. 验证IP地址\" on LeetCode. The problem requires validating whether a given string is a valid IPv4 address, IPv6 address, or neither.\n\nThe solution consists of the following changes:\n- Added a new file `lc-0468.md` which contains the problem description.\n- Added a new file `solution.go` which contains the implementation of the solution.\n- Added a new file `testcases.txt` which contains test cases for the solution.\n\nThe solution uses two helper functions `getIPV4` and `getIPV6` to validate IPv4 and IPv6 addresses respectively. The `validIPAddress` function checks whether the given IP address is valid IPv4 or IPv6 and returns the result accordingly.\n\nThe solution has been tested with the provided test cases and produces the expected output.","shortMessageHtmlLink":"feat(leetcode/go/0468.validate-ip-address): add solution for validati…"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wOS0xOFQxNjoyNzoxNy4wMDAwMDBazwAAAAS57gXc","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wMS0xNFQwNzo0MjoxMS4wMDAwMDBazwAAAAPfOWhy"}},"title":"Activity · Albert26193/my-learn-algorithm"}