text stringlengths 37 1.41M |
|---|
# Sensor Sleep Mode Example.
# This example demonstrates the sensor sleep mode. The sleep mode saves around
# 40mA when enabled and it's automatically cleared when calling sensor reset().
import sensor, image, time, pyb
from pyb import LED
led = LED(1) # red led for running check
def test():
sensor.sleep(False)
l... |
class RegressionModels:
'Simplifying Model Creation to Use Very Efficiently.'
def linear_regression (train, target):
'''Simple Linear Regression
Params :-
train - Training Set to train
target - Target Set to predict'''
from sklearn.linear_model imp... |
print("What is your name?")
name = input()
print("What is your address?")
address = input()
print("What is your phone number?")
number = input()
print("What is your major?")
major = input()
print("Your name: ", name)
print("Your address: ", address)
print("Your number: ", number)
print("Your major: ", major) |
#!/usr/bin/python2
#use at your own risk
#I do not guarantee the correctness of this program
#I mainly made this to try and generate an already known solution
#we will need to do square roots later
#we are using cmath because the normal
#math module gives an error when we it sqrt(-1)
from cmath import sqrt
#We're goi... |
"""
Реализуйте функцию almost_double_factorial(n), вычисляющую произведение всех нечётных натуральных чисел, не превосходящих nnn.
В качестве аргумента ей передаётся натуральное (ноль -- натуральное) число n⩽100n \leqslant 100n⩽100.
Возвращаемое значение - вычисленное произведение.
Комментарий. В случае, если n = 0... |
"""
Напишите функцию, которая находит сумму четных элементов на главной диагонали квадратной матрицы (именно чётных элементов, а не элементов на чётных позициях!). Если чётных элементов нет, то вывести 0. Используйте библиотеку numpy.
"""
import numpy as np
def diag_2k(a):
#param a: np.array[size, size]
#YO... |
x=int(input())
fact=1
if x<=20:
while x>0:
fact=fact*x
x=x-1
print(fact)
else:
print("enter the valid input")
|
class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
diff = {}
for i in range(len(nums)):
if (target - nums[i]) in diff:
return [diff[target-nums[i]], i]
elif ... |
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def longestUnivaluePath(self, root):
"""
:type root: TreeNode
:rtype: int
"""
self.longest = 0
... |
class Solution:
def merge(self, nums1, m, nums2, n):
"""
:type nums1: List[int]
:type m: int
:type nums2: List[int]
:type n: int
:rtype: void Do not return anything, modify nums1 in-place instead.
"""
last1 = m - 1
last2 = n - 1
last = ... |
class Solution:
def mergeTrees(self, t1, t2):
"""
:type t1: TreeNode
:type t2: TreeNode
:rtype: TreeNode
"""
root = t1 or t2
if root:
merge = t1 if t1 != root else t2
if merge:
root.val = root.val + merge.val
... |
print "I will now count my chickens:"
print "Hens", 25+30/6
print "Roosters",100-25*3%4
print "Now I will count my eggs:"
print 3+2+1-5+4%2-1/4+6
print "Is it true that 3+2<5-7?"
print 3+2<5-7
print "What is 3+2?",3+2
|
"""
@author: karthikrao
Moves defined for Simulated Annealing.
"""
import random
from tests import *
"""
Swap two adjacent operands.
"""
def move1(exp):
"""
Parameters
----------
exp : list
Input Polish Expression.
Returns
-------
exp : list
Output Polish Expression.
... |
from turtle import *
import random
Screen()
speed(0)
shape('circle')
shapesize(2)
pensize(3)
color('black')
down()
def m():
up()
def draw():
down()
def drag():
ondrag(goto)
colors=['red','orange','green','black','brown','cyan']
def sw():
color(random.choice(colors))
def cl... |
# user input
#input function
name = input("Hello I will make a sentence on your name and age just do What i say\nType your name: ")
age = input("Type Your Age: ")
print("Hello "+ name + ". \n"+ "Your Age is "+ age + " yrs.")
|
print("Welcome To Kavya's Calculator.You Can Only Add Two Numbers Using This calculator")
num1 = input("type the number: ")
num2 = input("type another number: ")
num3 = int(num1)
num4 = int(num2)
print("total value of "+num1 + " + " + num2 + " is " + str(num3 +num4))
#str function is used to convert number to string
... |
"""
Author: Diallo West
Date Created: April 24, 2016
Title: Work log with a Database
Description:
Create a command line application that will allow employees to enter their name, time worked, task worked on, and general notes about the task into a database. There should be a way to add a new entry, list all entrie... |
import random
# BigNum v1.0
# a game by Dan Sanderson (aka Doc Brown)
#
# Enter bet ('h' for instructions, 'q' to quit, 200 minimum):
# h
#
#
# BigNum is a fairly simple game. You have five places to put
# digits to construct a five digit number. These five digits are
# picked randomly (from 0 to 9),... |
def hamming():
dna_1 = raw_input("Enter string 1: ")
dna_2 = raw_input("Enter string 2: ")
d_h = 0
for i in range(len(dna_1)):
if dna_1[i] != dna_2[i]:
d_h += 1
print d_h
hamming()
|
def reverse_complement():
dna = raw_input("String: ")
dna = dna[::-1]
dna = list(dna)
for i in range(len(dna)):
if dna[i] == "A":
dna[i] = "T"
elif dna[i] == "T":
dna[i] = "A"
elif dna[i] == "G":
dna[i] = "C"
elif dna[i] == "C":
dna[i] = "G"
else:
print "Invalid character"
print "".join(d... |
# a d g
# b e h
# c f
import math
def print_f(string):
list_string = string.split(" ")
list_string = sorted(list_string)
N = len(list_string)
num = math.ceil(N/3)
table=[]
for row in range(num):
temp=[]
for col in range (row, N, 3):
temp.append(li... |
# import random
# import os
# import time
# import sys
# terminal_size = os.get_terminal_size()
# def recursive():
# num = 3
# for col in range(terminal_size[0]):
# for position in range(0, terminal_size[1]):
# num *= random.randint(1, 10)
# f = random.randin... |
class Node:
def __init__(self, data=None, next=None):
self.data = data
self.next = next
class SingleLinkedList:
def __init__(self):
self.head = None
def add_node(self, data):
newNode = Node(data)
if self.head:
current = self.head
... |
def recursive_multiply(first_num, second_num):
if second_num == 0 or any(num < 0 for num in (first_num,second_num)):
return 0
return first_num + recursive_multiply(first_num, second_num-1)
print(recursive_multiply(-1, -2)) |
# def get_perm(string):
# perm = []
# if len(string) == 0:
# perm.append(" ")
# return perm
# first = string[0]
# remaining = string[1:]
# words = get_perm(remaining)
# for word in words:
# index = 0
# for letter in word:
# permutation = cha... |
# Write a function that rotates a list by k elements.
# For example [1,2,3,4,5,6] rotated by two becomes [3,4,5,6,1,2].
# Try solving this without creating a copy of the list.
# How many swap or move operations do you need?
# step 1 - take in argument k
def Rotate(k, l):
# based on k, we pop the initial val... |
class LinkedListNode:
def __init__(self, value):
self.value = value
self.next = None
def __str__(self):
return self.value
def p(self):
if self.next:
print self.value, self.next.p()
else:
print self.value
def insert(self, v):
if ... |
# https://www.interviewcake.com/question/python/find-rotation-point
def solve(alist):
return binary(alist, 0, len(alist))
# the space is O(lgN)
def binary(alist, i, j):
mid = (j-i) / 2
mid_value = alist[mid]
if alist[mid-1] > mid_value:
return mid
if mid_value > alist[0]:
# sho... |
x = "hello"
y = "hello"
print(x is y)
print(x == y) |
class Person:
def __init__(self, name, age):
self.name = name
self.age = age
def nameLength(self):
return len(self.name)
p1 = Person("John", 36)
print(p1.name)
print(p1.age)
print(p1.nameLength()) |
def filter2(s):
if len(s) == 0: return False
res = True
for c in s:
k = ord(c)
if k < 97 or k > 122:
res = False
break
return res
def filter1(s, t):
res = 0
for c in s:
if c == t: res = res + 1
return res == 1
def filter3(s):
pos1 = s.fin... |
import re
txt = "The rain in Spain"
x = re.sub(r"[a-z]", "*", txt)
print(x) |
# Write a program which will find all such numbers which are divisible by 7 but are not a multiple of 5,
# between 2000 and 3200 (both included).
# The numbers obtained should be printed in a comma-separated sequence on a single line.
# Hints:
# Consider use range(#begin, #end) method
length = []
for i in range(2000... |
# Colored Triangles
# A coloured triangle is created from a row of colours, each of which is red, green or blue.
# Successive rows, each containing one fewer colour than the last, are generated by considering
# the two touching colours in the previous row. If these colours are identical, the same colour
# is used in th... |
import matplotlib.pyplot as plt
# set the size of the graph image
plt.rcParams["figure.figsize"] = (19, 11)
def plot(p_type: str, x_axis: list, points: list, title: str, x_label: str, y_label: str, y_min_lim=0, y_max_lim=0,
color='blue', marker='D',
width=0.30):
# if y_min_lim and y_max_lim are... |
##############################################
## Name: Creating two stacks using an array ##
## Owner: Darshit Pandya ##
## Purpose: Data Structures Practice ##
##############################################
class TwoStacks():
def __init__(self, n):
self.n = n
self.top1 = -1
self.top... |
################################################
## Name: Implementation of Binary Search Tree ##
## Owner: Darshit Pandya ##
## Purpose: Data Structure Practice ##
################################################
class Node:
def __init__(self, value):
self.left = None
se... |
"""
For Class #3 of an informal mini-course at NYU Stern, Fall 2014.
Topics: pandas data management
Repository of materials (including this file):
* https://github.com/DaveBackus/Data_Bootcamp
Prepared by Dave Backus, Sarah Beckett-Hile, and Glenn Okun
Created with Python 3.4
"""
import pandas as pd
"""
Examp... |
"""
Sarah's Chipotle code
"""
import pandas as pd
#import numpy as np
#import re
# first, define a pathway to tell python where this data can be found
path = 'https://raw.githubusercontent.com/TheUpshot/chipotle/master/orders.tsv'
# now import the data with pandas' read_table function
# read_table turns the data into... |
"""
Messing around with World Bank data. We start by reading in the whole WDI
from the online csv. Since the online file is part of a zipped collection,
this turned into an exploration of how to handle zip files -- see Section 1.
Section 2 (coming) does slicing and plotting.
Prepared for the NYU Course "Data Boo... |
import pinject
class OuterClass(object):
def __init__(self, inner_class):
self.inner_class = inner_class
class InnerClass(object):
def __init__(self):
self.forty_two = 42
obj_graph = pinject.new_object_graph()
outer_class = obj_graph.provide(OuterClass)
print(outer_class.inner_c... |
from fractions import gcd
# all numbers divisible by these are summed
residues = (3, 5)
# max number to check to (exclusive
max_num = 1000
# returns the result from brute force checking
def brute_force():
# the end sum
result = 0
# loop through every number under max, and manually check
for i in range(0, max_num... |
# -*- coding: utf-8 -*-
from collections import namedtuple
import menu
jogadorReg = namedtuple("jogadorReg", "cod, cod_equipa, nome, golosm, goloss, cartõesa, cartõesv")
listaJogadores = []
def encontrar_posicao(codigo):
pos = -1
for i in range (len(listaJogadores)):
if listaJogadores[i].id == co... |
#!/usr/bin/env python3
def test_0():
print("Hello, World!")
def test_1(n: int) -> None:
def _is_even(n: int) -> bool:
if n % 2 == 0:
return True
return False
if _is_even(n):
if (n >= 2 and n <= 5) or (n > 20):
print("Not Weird")
return
prin... |
import eulerlib
import itertools
def compute(number_of_digits: int = 3) -> int:
"""
A palindromic number reads the same both ways. The largest palindrome made from the product of
two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
Note... |
def swap_case(s):
s = list(s)
for i, char in enumerate(s):
if char.isupper():
s[i] = char.lower()
if char.islower():
s[i] = char.upper()
return "".join(s)
def split_and_join(line):
return "-".join(line.split(" "))
def print_full_name(a, b):
print('Hello {} {... |
import math
def compute(n: int = 20) -> int:
"""
So I cheated and saw that this was a well-known combinatorial problem. For an n x n grid,
the answer is 2n choose n.
Args:
n (int, optional): n by n grid. Defaults to 20.
"""
return math.factorial(2 * n) // (math.factorial(n) * math... |
import sqlite3
con=sqlite3.connect('uservisit.db')
cur=con.cursor()
print("Database Created Successfully")
cur.execute("DROP TABLE if EXISTS admin")
cur.execute('''CREATE TABLE admin
(admin_id INT PRIMARY KEY NOT NULL,
admin_name TEXT NOT NULL,
admin_uname ... |
import random
import sqlite3
import datetime
from os import system, name
import time
conn = sqlite3.connect('banking_system.sqlite')
class Customer:
def __init__(self, customer_id = None):
# Constructor:
if customer_id != None:
self.__retrieve_customer_data(customer_id)
elif custom... |
def writeHDF5(path, image):
""" creates a hdf5 file and writes the mask data
Parameters
----------
path : A string that is the path to the hdf5 file that will be written
image : An image object, from which the data will be stored
Returns
-------
"""
print("not implemented yet")
... |
import random
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
def shuffleList(self, head):
if not self.head or not self.head.next:
return head
left = slow = fast = head
fast = fast.next
while fast and fast... |
##https://docs.python.org/3/library/sqlite3.html
import sqlite3
conn = sqlite3.connect('Users.db')
c = conn.cursor()
class User:
username = None
password = None
creditCard = None
address = None
# default constructor
def __init__(self, username, password):
self.user... |
#
# Greg's Homework for Essex
# 9/15/2020
#
# #################################################################################################
# ## ##
# ## We define the following classes ... |
a = []
b = []
c = []
for i in range(0,4,1):
a.append(i+1)
b.append(i+5)
c.append(i+9)
list_2 = [a,b,c]
for i in [0,1,2]:
print("list_1(%d): " % i, list_2[i])
print("-----------------------------------------------------------")
print("list_2: ", list_2)
print("--------------------------------------... |
string = []
while (True):
string = input("문자열 입력 : ")
if( string == "exit"):
break;
else:
print("대소문자 변환 결과 =>", end="")
for i in range(0, len(string), 1):
if ('A' <= string[i] <= 'Z'):
print(string[i].lower(), end="")
elif ( 'a' <= string[i... |
n = int(input())
add_n = n + n
multiply_n_by_add_n = add_n * n
subtract_n_from_result = multiply_n_by_add_n - n
division = subtract_n_from_result // n
print(division) |
from sys import argv
script, user_name = argv
prompt = '>'
print "Hi, %s, im the %s script"%(user_name,script)
print "do you like me, %s?" % user_name
like = raw_input(prompt)
#prompt means the terminal will show the things you defined for prompt and than u can input the things.
print "hahaha= %s"% like
... |
#exercise 24
print "let's practise something"
print "You \'d need to know \'about escape with \\ that do \n newlines and \t tabs"
poem = """
\t the lovely world
with logic so firmly planted
cannot discern \n the needs of lovelynor comprhend passion form intuition
and requies an explanation
\t\n\t where the... |
import cv2
import numpy as np
img = cv2.imread('lena.jpg', -1) #imread(<file name>,1/0/-1) using for read image
print(img)
cv2.imshow('image', img) #imshow is used to show image in the img and first argument is used to visable a name in the show in title bar
key = cv2.waitKey(0) #waitkey is a method is used to hold th... |
print("Enter a sentence: ")
seq = list(set(input().split()))
seq.sort()
print("Sorted and no duplicate words")
for word in seq:
print(word,end=" ")
|
class Node:
def __init__(self, data=None, head=None):
self.data = data
class LinkedList():
def __init__(self, head=Node):
self.head = None
def insert(self, data):
new_node = Node(data)
new_node.head = self.head
self.head = new_node
def delete(self, data):
cur = self.head
found = Fa... |
def max(x,y):
if x>y:
return x
else:
return y
def min(x,y):
if x<y:
return x
else:
return y
x,y = map(int, raw_input().split())
print "%d"%(max(min(x,y),x)) |
def sum(a,b):
result=0
result=a+b
return result
answer=0
answer=sum(3,4)
print("%d"%answer)
|
def Factorial(n):
if n == 0:
return 1
else:
return n * Factorial(n-1)
for i in range(1,6):
print "%d! = %d"%(i,Factorial(i)) |
def print_max(a,b):
if a > b:
print(a, "is max")
elif a == b:
print(a, "is equal to", b)
else:
print(b, "is max")
print_max(3,4)
x=5
y=7
print_max(x,y)
|
print("Input hour minite second : ",end="")
h,m,s=map(int,input().split())
to_mid=0
to_mid+=h*3600
to_mid+=m*60
to_mid+=s
print("now midnight from %d second after"%(to_mid))
|
class Node:
def __init__(self, data=None, next=None):
self.data = data
self.head = next
def print_list(self):
temp = self.head
while temp:
print temp.data,
print "->",
temp = temp.next
print "None"
def insert(self, data):
new_node = Node(data)
new_node.next = self.head
self... |
ch='a'
while True:
print("Input character(if input=q is exit) : ",end="")
ch=input()
if(ch=='q'):
break
print("loop exit")
|
a=0
b=0
c=0
for i in range(0,3):
if(a==0):
print("Input : ",end="")
a=int(input())
continue
if(b==0):
print("Input : ",end="")
b=int(input())
continue
if(c==0):
print("Input : ",end="")
c=int(input())
continue
if(a>b):
if(a>c):
... |
def Recursive(num):
if num <= 0:
return
print "Recursive call! %d"%(num)
Recursive(num-1)
Recursive(3) |
print("Input Two Integer : ",end="")
a,b=map(int,input().split())
print("Sum : %d + %d = %d"%(a,b,a+b))
print("Sub : %d - %d = %d"%(a,b,a-b))
|
# python3.7.11
# algorithm function (takes only ideal scenario into consideration):
def find_pivot(array):
# array must have at least 3 elements:
if len(array) < 3:
return -1
# solution for an array with just 3 elements:
if len(array) == 3:
return {'index': 1, 'value': array[1], 'sum': ... |
# -*- coding: utf-8 -*-
"""
Created on 17-03-2019 at 02:59 PM
@author: Vivek
"""
class Employee:
# Constructor
def __init__(self, name, ID, salary):
self.empName = name
self.empID = ID
self.empSalary = salary
# Defines behaviour when called using print() or str()
def __str__(s... |
T = int(input())
for i in range(T):
n = int(input())
if n%2 == 0:
print("%d is even"%n)
else :
print("%d is odd"%n)
|
while True:
a,b,c = map(int,input().split())
if a+b+c == 0:
break
list=[a,b,c]
if sum(list) <= max(list)*2 :
print('Invalid')
elif a==b==c :
print('Equilateral')
elif a==b or a==c or b==c :
print('Isosceles')
else :
print('Scalene')
|
p=1
while(p==1):
def isPalindrome(s):
return s==s[::-1]
s = input("Enter the string: ")
ans = isPalindrome(s)
if ans:
print("It is a palindrome")
else:
print("Not a palindrome")
flag=0
while(flag == 0):
p = int(input("Enter 1 to continue and 0 to e... |
# Generate the rigid body transformation matrix from rotation matrix and
# translation matrix using homogeneous representation.
#-----------------------------------------------
import numpy as np
def trans(R,p):
# Dimension Check
assert (R.shape == (3,3) and p.shape ==(3,1)), "This function requires 3*3 matrix and... |
#Take user input, create a Python list, find a value in the list, and if it is present, replace it with 200. Only update the first occurrence of a value
a=float(input("enter first no:"))
b=float(input("enter second no:"))
c=float(input("enter third no:"))
list1=[a,b,c]
print(list1)
d=float(input("enter a value ... |
"""exorcise 2 26/2/20 mean counter"""
number = []
keep_asking = True
while keep_asking == True:
num = int(input("Enter a number :"))
if (num) == -1 :
keep_asking = False
else:
number.append (num)
for i in range(len(number)):
print(number[i])
p... |
"""19/2/2020 trademe code"""
item = input("what would u like to sell?: ")
reserve_price = int(input("what would you like the item to go for?: "))
highest_price = 0
highest_name = "Jesus Jimminy Christmas"
reserve_met = 0
auction_run = True
while auction_run == True :
name = input("please enter your name: ")
... |
# Learning Python's numpy library via the official documentation and Justin Johnson's Tutorial http://cs231n.github.io/python-numpy-tutorial/
import numpy as np
matrix1 = np.eye(3)
matrix2 = np.array([[2,0,0], [0,2,0],[0,0,2]], dtype=np.float64)
# adding matrices - the two produce the same thing
print(matrix2 + m... |
import turtle,math,time
n=200
count=0
for a in range ((n+2)/3,(n-1)/2+1):
for b in range (n+2)/3,(n-1)/2+1):
for c in range (n+2)/3,(n-1)/2+1):
if b+c>a:
count=count+1
#print (a,b,c)
print (count)
#3 sides
#a=5
#b=4
#c=3
#calcuate the degrees
abDeg... |
import sys
# Print all the arguments
print ("Arguments list:{}", str(sys.argv))
#Print only 2nd argument. Catch exception if there is no second argument
try:
print (sys.argv[2])
except IndexError:
print ("Second argument not found")
else:
print ("Done")
|
# Define a variable (add) that represents a statement that can take arguments (n, m).
# This variable is linked to the statement n + m using the lambda keyword which represents a lambda function
add = lambda n, m: n + m
subtract = lambda n, m: n - m
# Call the lambda function using the variable name as if that is a ... |
# -*- coding: utf-8 -*-
"""
Created on Sun Dec 8 12:54:34 2019
@author: Abhishek
"""
n1=int(input("number1"))
if(n1%6==0):
print("window")
elif(n1%6==1):
print("window")
elif(n1%6==2):
print("middle")
elif(n1%6==5):
print("middle")
elif(n1%6==3):
print("aisle")
elif(n1%6==4):
print("aisle")
p... |
import urllib.request
import zipfile
import requests
def download_geotiff(directory, file_name):
"""
This function downloads the GeoTiff file according to file_name.
The file name should be defined in Topodata.py
Ex:
coordinates = [-00.00, -00.00, -00.00, -00.00]
file_name = Topodata.file_name... |
semesters = ['Fall', 'Spring']
# Add values
semesters.append('Summer')
semesters.append('Spring')
print(semesters) # ['Fall', 'Spring', 'Summer', 'Spring']
# Remove values
semesters.remove('Spring')
print(semesters) # ['Fall', 'Summer', 'Spring']
# Access any value using it's index
first_item_in_list = semesters[0]
... |
# Python program implementing single-byte XOR cipher
# English frequency of letters
english_freq = [
8.167, 1.492, 2.782, 4.253, 12.702, 2.228, 2.015, 6.094, 6.966, # A-I
0.153, 0.772, 4.025, 2.406, 6.749, 7.507, 1.929, 0.095, 5.987, # J-R
6.327, 9.056, 2.758, 0.978, 2.360, 0.150, 1.974, 0.074 # S-Z
]
d... |
# Author : moranzcw
# Date : 2016-04-13
# This script is used to generate a list of links from leetcode.com
import os
import re
from urllib import request
from bs4 import BeautifulSoup
response = request.urlopen('https://leetcode.com/problemset/algorithms/')
html_content = response.read()
soup = BeautifulSoup(html... |
#1. Você tem uma lista de número: [6,7,4,7,8,4,2,5,7,'hum', 'dois']. A ideia do exercício é tirar a média de todos os valores contidos na lista, porém para fazer o cálculo precisa remover as strings.
print("Bem-vindo")
#Exercicio 1
total = 0
index = 0
x = [6,7,4,7,8,4,2,5,7,'hum', 'dois']
for valor in x:
if type(va... |
"""Homework file for my students to have fun with some algorithms! """
def find_greatest_number(incoming_list: list):
"""
Required parameter, incoming_list, should be a list.
Find the largest number in the list.
"""
return max(incoming_list)
def find_least_number(incoming_list: list):
"""
... |
'''
Written by Cham K.
June 16th 2015
'''
from sequence_manipulation import nucleotide_count
def nucleotide_composition(sequence, base):
''' (str, str) -> (float)
Returns the amount (percentage rounded to 2 decimal places) of a specified nitrogenous base (A, T, C, or G) in a DNA sequence.
Can process uppe... |
"""
The approach here is to keep another array and iterate over the given input array. at each iteration
store the element value -1 indexed place as 1 in the new formed array. finally iterate over the new formed
array and if there is no 1 found in the new formed array then the element is not there in the main array.
L... |
# coding: utf-8
##Caesar暗号を生成/解読するスクリプト用のアルファベットリストの場合は冗長##
#alphabetList = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
##ASCIIコードを使用してアルファベットを生成する方法がスマート
#小文字が97から123までのxrange 大文字が65から91までのxrange
#alphabetTable = [chr(i) for i in range(ord('A'), ord('Z')+... |
# ask the user for a filename from which it will take its input
# open the file with that filename and reads an integer at the beginning of the file that is the number of lines that follow
# open a file called output.txt
# reads in the strings of the input, one at a time, and writes to the output file either "accept" o... |
from stack_that import stack_that
import sys
class cave_runner(object):
#do I want to make a dictionary...???
def __init__(self):
self.traversed = stack_that()
self.choices = []
self.hat = []
self.size_x = 0
self.size_y = 0
self.row = 0
self.col = 0
... |
#------------------------------------------------------------------------------#
# Name: Rebeccah Hunter
# File: BinarySearchTree.py
# Purpose: CSC 236 Example of creating and using binary search trees in Python.
#
# Shows how to use a tree to store information, and in particular how to
# search through ... |
################################################################################
# Purpose: to create a fun and rewarding virtual pet for a programmer to interact with.
# Perfect for the person who is allergic to everything and can't have real pets...
# Author: Rebeccah Hunter
# Acknowledgments: Berea College Computer ... |
"""
Author: Max Martinez Ruts
Date: October 2019
Description:
Creation of AVL data structure with search, insertion and deletion implementations
"""
class AVL:
def __init__(self):
self.root = None
"""
Description:
Check for unbalances comparing left and right subtrees recursively by followin... |
"""
Author: Max Martinez Ruts
Date: October 2019
Description:
Skip List:
Data structure consisting in a group of double linked lists stacked above one other with the properties that
lists stacked in upper levels skip certain elements found in lower lists of lower levels.
Furthermore, if an element is found in list l... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.