程序员面试精选【codeoffer】

Golang 不规范时间格式的转换go语言在处理年月日时间格式的时候，总是需要按照官方规范的格式进行定义，且不支持变更，这在很多场景下是不能适应的，比如处理excel时的日期格式总数2021/7/15，但是官方包只支持解析"2006/01/02",也就是说月份必须是两位数，难道要我匹配补齐两位数吗？很麻烦有没有！然后发现轮子早已被造好，这个库支持各种各样的时间格式，甚至是英文和汉字，太????了。https://github.com/araddon/dateparse用起来也很简单，直接Parse

Golang正则表达式不支持复杂正则和预查问题解决我有一个需求，需要匹配一段字符串中第几季的这个几，那么按正则表达式的语法，我的表达式应该是这样的`(?<=第)\d+(?=季)`然而，当我用go官方包regexp的时候，compile的时候报了个错误：error parsing regexp: invalid or unsupported Perl syntax: (?<啥意思呢？语法错误，不支持(?<，然而我在线运行的时候明明是没错的，这说明go的正则引擎不支持负向预查

问：Redis和memcache都是常用的缓存工具，但他们有哪些不同你知道吗？平常应用中怎么选择呢？先说结论，我认为他们有以下几方面的不同：1、Redis和Memcache都是将数据存放在内存中，memcache还可用于缓存其他东西，例如图片、视频等等，但最大只能缓存1M。Redis最大缓存可达512M。2、Redis不仅仅支持简单的k/v类型的数据，同时还提供lis...

Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Note:The input is assumed to be a 32-bit signed integer. Your function

题目：Write a function to find the longest common prefix string amongst an array of strings.分析：只需用第一个字符串与后面的进行比较，最大长度不能大于第一个字符串的长度class Solution {public: string longestCommonPrefix(vector& s

Integer to RomanGiven an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Subscribe to see which companies asked this question.class Solution

There are 1000 buckets, one and only one of them contains poison, the rest are filled with water. They all look the same. If a pig drinks that poison it will die within 15 minutes. What is the minimum

Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.

Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convertin

Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the sam