概览
晋升是每个技术人都应该经历的一次洗礼。一般来说,分为提名、准备、述职、答辩这四个步骤。
尽管每个人的经历与体会都有不同,很难照搬硬套,但我相信只要是真心分享的经验,总会对人有帮助。接下来,我将从五个点展开。
原题链接 https://leetcode-cn.com/problems/container-with-most-water/
1 | func maxArea(height []int) int { |
原题链接 https://leetcode-cn.com/problems/regular-expression-matching/
1 | func isMatch(s string, p string) bool { |
原题链接 https://leetcode-cn.com/problems/longest-palindromic-substring/
1 | func longestPalindrome(s string) string { |
原题链接 https://leetcode-cn.com/problems/median-of-two-sorted-arrays/
1 | func findMedianSortedArrays(nums1 []int, nums2 []int) float64 { |
原题链接 https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/
1 | func lengthOfLongestSubstring(s string) int { |
原题链接 https://leetcode-cn.com/problems/add-two-numbers/
我们继续看上一个题目,这次我们尝试写一个非递归的解法。
1 | type ListNode struct { |
原题链接 - https://leetcode-cn.com/problems/add-two-numbers/
1 | type ListNode struct { |
原题链接 https://leetcode-cn.com/problems/binary-search/submissions/
1 | func search(nums []int, target int) int { |