C++(clang++11) 解法, 执行用时: 40ms, 内存消耗: 6436K, 提交时间: 2021-01-22 22:39:07

int a[1111];
int ok()
{
	return (a['n']>0)&&(a['p']>0)&&(a['y']>0);
}
class Solution
{
	public:
		int Maximumlength(string s)
		{
			int n=s.length(),i,j,ans=0;
			s+='0';
			j=-1;
			for(i=0;i<n;i=i+1)
			{
				while(j<n&&!ok())
				{
					j++;
					a[s[j]]++;
				}
				ans=max(ans,j-i);
				a[s[i]]--;
			}
			return ans;
		}
};

Go(1.14.4) 解法, 执行用时: 17ms, 内存消耗: 3984K, 提交时间: 2020-12-01 21:04:23

package main

// github.com/EndlessCheng/codeforces-go
func Maximumlength(s string) (ans int) {
	c := ['z'+1]int{}
	l := 0
	for r := range s {
		c[s[r]]++
		for c['n']*c['p']*c['y'] > 0 {
			c[s[l]]--
			l++
		}
		if r-l+1 > ans {
			ans = r - l + 1
		}
	}
	return
}

Python3(3.9) 解法, 执行用时: 643ms, 内存消耗: 21304K, 提交时间: 2020-12-02 11:50:35

class Solution:
  def Maximumlength(self , x ):
    return max([max([len(i) for i in x.split(j)]) for j in 'npy'])