Exemplos de longest_non_repeat_v1 em Python

Exemplo n.º 1

    def test_longest_non_repeat_v1(self):

        string = "abcabcbb"
        self.assertEqual(longest_non_repeat_v1(string), 3)

        string = "bbbbb"
        self.assertEqual(longest_non_repeat_v1(string), 1)

        string = "pwwkew"
        self.assertEqual(longest_non_repeat_v1(string), 3)

Exemplo n.º 2

Arquivo: test_array.py Projeto: Danawill/algorithms

    def test_longest_non_repeat_v1(self):

        string = "abcabcbb"
        self.assertEqual(longest_non_repeat_v1(string), 3)

        string = "bbbbb"
        self.assertEqual(longest_non_repeat_v1(string), 1)

        string = "pwwkew"
        self.assertEqual(longest_non_repeat_v1(string), 3)

        string = "dvdf"
        self.assertEqual(longest_non_repeat_v1(string), 3)

        string = "asjrgapa"
        self.assertEqual(longest_non_repeat_v1(string), 6)

Exemplo n.º 3

Arquivo: 6.Arrays_longest_non_repeat.py Projeto: seanlab1/algorithms-1

"""
Given a string, find the length of the longest substring
without repeating characters.
Examples:
Given "abcabcbb", the answer is "abc", which the length is 3.
Given "bbbbb", the answer is "b", with the length of 1.
Given "pwwkew", the answer is "wke", with the length of 3.
Note that the answer must be a substring,
"pwke" is a subsequence and not a substring.
"""
from algorithms.arrays import longest_non_repeat_v1, longest_non_repeat_v2

a = "abcabcbb"
b = "bbbbb"
c = "pwwkew"

print(longest_non_repeat_v1(a))
print(longest_non_repeat_v1(b))
print(longest_non_repeat_v1(c))

print(longest_non_repeat_v2(a))
print(longest_non_repeat_v2(b))
print(longest_non_repeat_v2(c))

### 박제준 3/11