LeetCode各题解法分析~（Java and Python）. Contribute to YutingZ92/LeetCode-1 development by creating an account on GitHub.

Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string's permutations is the substring of the second string.

The permutations of a single-letter string is a set of one element, the single-letter string.

In this paper, we introduce new codeword sets based on order complexity (OC) which measures uncertainty of the order having each permutation string. The proposed codeword sets are generated by two ...