Initial commit

Author: Cenkay

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2019 Cenkay Arapisaoglu
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -0,0 +1,9 @@
+class Solution(object):
+    def getIntersectionNode(self, headA, headB):
+        r1, r2, l1, l2 = headA, headB, 0, 0
+        while headA: headA, l1 = headA.next, l1 + 1
+        while headB: headB, l2 = headB.next, l2 + 1
+        while l1 > l2: r1, l1 = r1.next, l1 - 1
+        while l2 > l1: r2, l2 = r2.next, l2 - 1
+        while r1 != r2: r1, r2 = r1.next, r2.next
+        return r1

solutions/python/160.py

@@ -0,0 +1,5 @@
+class Solution:
+    # @param n, an integer
+    # @return an integer
+    def reverseBits(self, n):
+        return int(bin(n)[2:].zfill(32)[::-1],2)

solutions/python/190.py

@@ -0,0 +1,14 @@
+class Codec:
+
+    def encode(self, strs):
+        return "".join(str(len(s)) + ":" + s for s in strs)
+
+    def decode(self, s):
+        strs = []
+        while s:
+            i = s.find(":")
+            length = int(s[:i])
+            s = s[i+1:]
+            strs.append(s[:length])
+            s = s[length:]
+        return strs

solutions/python/271.py

@@ -0,0 +1,18 @@
+# The knows API is already defined for you.
+# @param a, person a
+# @param b, person b
+# @return a boolean, whether a knows b
+# def knows(a, b):
+
+class Solution(object):
+    def findCelebrity(self, n):
+        i = 0
+        while i < n:
+            person = i
+            i += 1
+            while i < n and not knows(person, i) and knows(i, person):
+                i += 1
+        j = person - 1
+        while j >= 0 and not knows(person, j) and knows(j, person):
+            j -= 1
+        return person if j < 0 else -1

solutions/python/277.py

@@ -0,0 +1,22 @@
+class ZigzagIterator(object):
+
+    def __init__(self, v1, v2):
+        self.arr1, self.arr2, self.l1, self.l2 = v1, v2, len(v1), len(v2)
+        self.i = self.j = 0
+        self.n, self.turn = max(self.l1, self.l2), v1 and 1 or 0
+
+    def next(self):
+        if self.turn:
+            num = self.arr1[self.i]
+            self.i += 1
+            if self.j < self.l2:
+                self.turn = 0
+        else:
+            num = self.arr2[self.j]
+            self.j += 1
+            if self.i < self.l1:
+                self.turn = 1
+        return num
+
+    def hasNext(self):
+        return self.turn and self.i < self.l1 or self.j < self.l2

solutions/python/281.py

@@ -0,0 +1,11 @@
+class Solution(object):
+    def guessNumber(self, n):
+        l, r, g = 1, n, 1
+        while g and l <= r:
+            m = (l + r) // 2
+            g = guess(m)
+            if g == 1:
+                l = m + 1
+            else:
+                r = m
+        return m

solutions/python/374.py

@@ -0,0 +1,6 @@
+class Solution(object):
+    def findNthDigit(self, n):
+        start, size, step = 1, 1, 9
+        while n > size * step:
+            n, size, step, start = n - (size * step), size + 1, step * 10, start * 10
+        return int(str(start + (n - 1) // size)[(n - 1) % size])

solutions/python/400.py

@@ -0,0 +1,14 @@
+class Solution(object):
+    def originalDigits(self, s):
+        res = ""
+        res += "0"*s.count('z')
+        res += "1"*(s.count('o')-s.count('z')-s.count('w')-s.count('u'))
+        res += "2"*s.count('w')
+        res += "3"*(s.count('h') - s.count('g'))
+        res += "4"*s.count('u')
+        res += "5"*(s.count('f') - s.count('u'))
+        res += "6"*s.count('x')
+        res += "7"*(s.count('s')-s.count('x'))
+        res += "8"*s.count("g")
+        res += "9"*(s.count('i') - s.count('x') - s.count("g") - s.count('f') + s.count('u'))
+        return res