LeetCodeDailyChallenges/WordPattern.html at main · Mohityadav-code/LeetCodeDailyChallenges · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>LeetCode Day 6</title>
    <style>
        body {
            background: yellowgreen;
        }

        pre {
            font-size: 20px;
            color: rgb(17, 0, 255);
        }
    </style>
</head>

<body>
    <h1>Given a pattern and a string s, find if s follows the same pattern.
        </br>
        Here follow means a full match, such that there is a bijection between
        </br>
        a letter in pattern and a non-empty word in s.

    </h1>
    <pre>
        Example 1 :
        Input: pattern = "abba", s = "dog cat cat dog"
        Output: true

        Example 2 :
        Input: pattern = "abba", s = "dog cat cat fish"
        Output: false
    </pre>
</body>
<script>
    function pushwords(){

        while (s[i] != " ") {
            a += s[i]
            i++
        }
        if (s[i + 1] != a[0]) {
            while (s[i + 1] != " ") {
                for (var i = 0; i < s.length; i++) {
                     if (a.length > 0) {
                        s = s.replace(a, "a")
                    }
                    if (b.length > 0) {
                        s = s.replace(b, "b")
                    }
                    if (s[i] != " ") {
                        compare.push(s[i])
                    }
                }
                b += s[i + 1]
                i++
            }
        }

    }
    function conditions(){
        if (s[i + 2] != b[0]) {
            if(s[i + 2] != a[0]){

                return false
            }
        }
    }
    function check(){

        var compare = []
        var s = "aa"
        var pattern = "a"
        pattern = Array.from(pattern)
        var a = "";
        var b = "";
        var i = 0
        if(s.length==pattern.length){
            while(i<pattern.length){
                if(pattern[i]==s[i]){
                    return true
                }
                i++
            }
        }
        var i = 0
        // Storing First word
        // Storing second Word
        console.log(i);
        // replacing words in string so we can compare easily
        console.log('compare: ', compare);
        console.log('pattern: ', pattern);
        // now comparing
    }

    console.log('check(): ', check());
    function compare(){
        var flag = 0
        for (var i = 0; i < pattern.length; i++) {
            if (pattern[i] != compare[i]) {
                flag = 1
            }
        }
        // returning value
        if (flag == 0) return true
        else return false
    }
</script>

</html>