Hackerrank
weixin_45405128
stay hungry, stay foolish.
展开
-
Time Complexity: Primality
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the primality function below.def primality(n): if n==1: return 'Not prime' if n==2: retur...原创 2020-02-14 17:42:55 · 150 阅读 · 0 评论 -
Miscellaneous: Flipping bits
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the flippingBits function below.def flippingBits(n): li=[0]*33 for i in range(1,33): n=n-2**(33...原创 2020-02-14 17:29:54 · 180 阅读 · 0 评论 -
TreesTrees: Is This a Binary Search Tree?
""" Node is defined asclass node: def __init__(self, data): self.data = data self.left = None self.right = None"""def checknode(node,min,max): if node == None: ...原创 2020-02-14 17:04:51 · 124 阅读 · 0 评论 -
Linked Lists:Reverse a doubly linked list
def reverse(head): left=None right=head while right: tmp=right.next #先保存下一个 right.next=left #换顺序 left=right #进1 right=tmp #进1 return left...原创 2020-02-14 02:06:59 · 199 阅读 · 0 评论 -
Linked Lists: Inserting a Node Into a Sorted Doubly Linked List
#!/bin/python3import mathimport osimport randomimport reimport sysclass DoublyLinkedListNode: def __init__(self, node_data): self.data = node_data self.next = None ...原创 2020-02-14 01:18:20 · 177 阅读 · 0 评论 -
Linked Lists: Insert a node at a specific position in a linked list
#!/bin/python3import mathimport osimport randomimport reimport sysclass SinglyLinkedListNode: def __init__(self, node_data): self.data = node_data self.next = Noneclass ...原创 2020-02-14 00:52:03 · 156 阅读 · 0 评论 -
Dynamic Programming: Max Array Sum
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the maxSubsetSum function below.def maxSubsetSum(arr): n=len(arr) v = [0] * n for i in range(n): ...原创 2020-02-14 00:37:11 · 131 阅读 · 0 评论 -
Hash Tables: Ice Cream Parlor
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the whatFlavors function below.#naive waydef whatFlavors0(cost, money): n=len(cost) #li=[] for i in ...原创 2020-02-13 23:00:31 · 148 阅读 · 0 评论 -
Recursion: Davis' Staircase
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the stepPerms function below.def stepPerms0(n): if n==1: return 1 if n==2: return 2 ...原创 2020-02-13 01:30:33 · 131 阅读 · 0 评论 -
Greedy Algorithms: Max Min
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the maxMin function below.def maxMin(k, arr): s=sorted(arr) li=[] for i in range(len(s)-k+1): ...原创 2020-02-12 18:46:54 · 191 阅读 · 0 评论 -
Greedy Algorithms: Greedy Florist
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the getMinimumCost function below.#my own solutiondef getMinimumCost0(k, c): if k>=len(c): retu...原创 2020-02-12 18:28:37 · 295 阅读 · 0 评论 -
Greedy Algorithms: Luck Balance
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the luckBalance function below.def luckBalance0(k, contests): print(contests) imp=[] score=0 fo...原创 2020-02-12 17:44:01 · 161 阅读 · 0 评论 -
Greedy Algorithms: Minimum Absolute Difference in an Array
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the minimumAbsoluteDifference function below.def minimumAbsoluteDifference(arr): s=sorted(arr) diff=s[-...原创 2020-02-12 16:28:34 · 98 阅读 · 0 评论 -
Dictionaries and Hashmaps: Count Triplets
#!/bin/python3'''import mathimport osimport randomimport reimport sys# Complete the countTriplets function below.#naive waydef countTriplets0(arr, r): s=sorted(arr) count=0 n=le...转载 2020-02-09 23:39:57 · 167 阅读 · 0 评论 -
Dictionaries and Hashmaps:Frequency Queries
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the freqQuery function below.from collections import defaultdictdef freqQuery(queries): data=defaultdict(...原创 2020-02-09 22:10:56 · 139 阅读 · 0 评论 -
Binary Search Tree : Lowest Common Ancestor
class Node: def __init__(self, info): self.info = info self.left = None self.right = None self.level = None def __str__(self): return str(sel...原创 2020-02-09 01:44:33 · 109 阅读 · 0 评论 -
Tree: Height of a Binary Tree
class Node: def __init__(self, info): self.info = info self.left = None self.right = None self.level = None def __str__(self): return str(sel...原创 2020-02-09 01:22:10 · 393 阅读 · 0 评论 -
Hash Tables: Ransom Note
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the checkMagazine function below.from collections import defaultdictdef checkMagazine(magazine, note): z...原创 2020-02-09 00:40:34 · 146 阅读 · 0 评论 -
Dictionaries and Hashmaps: Sherlock and Anagrams
import mathimport osimport randomimport reimport sys# Complete the sherlockAndAnagrams function below.from collections import defaultdictdef get_all_substrings(s):#先提出所有的子集 n=len(s)...原创 2020-02-09 00:16:29 · 157 阅读 · 0 评论 -
Sorting:Fraudulent Activity Notifications _bisect.insort() python
#!/bin/python3'''import mathimport osimport randomimport reimport sys# Complete the activityNotifications function below.#runtime error for some casesdef activityNotifications(expenditure...原创 2020-02-08 16:01:45 · 313 阅读 · 0 评论 -
Sorting: Comparator
Sample Input5amy 100david 100heraldo 50aakansha 75aleksa 150Sample Outputaleksa 150amy 100david 100aakansha 75heraldo 50from functools import cmp_to_keyclass Player: de...原创 2020-02-08 02:09:43 · 138 阅读 · 0 评论 -
Sorting: Mark and Toys
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the maximumToys function below.def maximumToys(prices, k): p=sorted(prices) ####直接用sorted(),如果用自己写的算法,runti...原创 2020-02-08 00:11:12 · 156 阅读 · 0 评论 -
Sorting: Bubble Sort
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the countSwaps function below.def countSwaps(a): count=0 for i in range(n): for j in range(n-1-i)...原创 2020-02-07 23:45:56 · 92 阅读 · 0 评论 -
String Manipulation:Special String Again
#!/bin/python3import mathimport osimport randomimport reimport sys'''# Complete the substrCount function below.def substrCount(n, s): #每个单独字符 result=n #连续两个,三个,,,n个字符相同 f...原创 2020-02-07 19:00:19 · 254 阅读 · 0 评论 -
String ManipulationSherlock and the Valid String
#!/bin/python3import mathimport osimport randomimport reimport sys# Complete the isValid function below.def isValid(s): zd={} for c in s: if c not in zd.keys(): ...原创 2020-02-07 01:57:05 · 130 阅读 · 0 评论 -
String Manipulation: Alternating Characters
Shashank非常喜欢字符串,特别是那些连续字符都是不一样的字符串。比如:他喜欢,但他不喜欢。给定一个字符串,该字符串只可能由字母和组成。Shashank想把这个字符串转变成他喜欢的字符串,在转变的过程中,他允许删除字符串中的某些字符。 你的任务就是找出最少需要删除几个字符,才能把给定的字符串转变成Shashank喜欢的字符串。样例输入:5AAAABBBBBABABABABBA...原创 2020-02-07 00:35:11 · 177 阅读 · 0 评论 -
ManipulationStrings: Making Anagrams
Alice is taking a cryptography class and findinganagramsto be very useful. We consider two strings to be anagrams of each other if the first string's letters can be rearranged to form the second str...原创 2020-02-07 00:13:14 · 114 阅读 · 0 评论