FilesExpand file tree

 master

/

test.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

240 lines (217 loc) · 5.34 KB

 master

/

test.py

Copy path

Top

File metadata and controls

• Code
• Blame

240 lines (217 loc) · 5.34 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

obj = {

"stuff": 'foo',

"data": {

"val": {

"thing": {

"info": 'bar',

"moreInfo": {

"evenMoreInfo": {

"weMadeIt": 'baz'

}

}

}

}

}

}

def collectStrings(obj):

result = []

for key in obj:

if type(obj[key]) is dict:

result = result + collectStrings(obj[key])

elif type(obj[key]) is str:

result.append(obj[key])

return result

print(collectStrings(obj))

# def collectStrings(obj, result=[]):

# # result = []

# for key in obj:

# if type(obj[key]) is dict:

# collectStrings(obj[key])

# elif type(obj[key]) is str:

# result.append(obj[key])

# return result

# print(collectStrings(obj))

# obj = {

# "num": 1,

# "test": [1,2,3,4],

# "data": {

# "val": 4,

# "info": {

# "isRight": True,

# "random": 66

# }

# }

# }

# def stringifyNumbers(obj):

# for key in obj:

# if type(obj[key]) is dict:

# stringifyNumbers(obj[key])

# elif type(obj[key]) is int:

# obj[key] = str(obj[key])

# elif type(obj[key]) is list:

# obj[key] = list(map(str, obj[key]))

# return obj

# print(stringifyNumbers(obj))

# words = ['i', 'am', 'learning', 'recursion']

# def capitalizeWords(words):

# if len(words)==0:

# return []

# result = []

# result.append(words[0].upper())

# return result + capitalizeWords(words[1:])

# print(capitalizeWords(words))

# def capitalizeWords(words, result=[]):

# if len(words)==0:

# return []

# # result = []

# result.append(words[0].upper())

# capitalizeWords(words[1:])

# return result

# print(capitalizeWords(words))

# obj1 = {

# "outer": 2,

# "obj": {

# "inner": 2,

# "otherObj": {

# "superInner": 2,

# "notANumber": True,

# "alsoNotANumber": "yup"

# }

# }

# }

# obj2 = {

# "a": 2,

# "b": {"b": 2, "bb": {"b": 3, "bb": {"b": 2}}},

# "c": {"c": {"c": 2}, "cc": 'ball', "ccc": 5},

# "d": 1,

# "e": {"e": {"e": 2}, "ee": 'car'}

# }

obj3 = {

# "a": 2,

"b": {"b": 2, "bb": {"b": 3, "bb": {"b": 2}}}

# "c": {"c": {"c": 2}, "cc": 'ball', "ccc": 5},

# "d": 1,

# "e": {"e": {"e": 2}, "ee": 'car'}

}

# def nestedEvenSum(obj, sum=0):

# print("first", sum)

# for key in obj:

# print("in for", sum)

# if type(obj[key]) is dict:

# sum += nestedEvenSum(obj[key])

# elif type(obj[key]) is int and obj[key]%2==0:

# sum += obj[key]

# return sum

# nestedEvenSum(obj1)

# print(nestedEvenSum(obj3))

# arr = ['car', 'taco', 'banana']

# def capitalizeFirst(arr):

# result = []

# if len(arr)==0:

# return result

# # for item in arr:

# result.append(arr[0][0].upper()+arr[0][1:])

# return result +(capitalizeFirst(arr[1:]))

# print(capitalizeFirst(arr))

# arr = [[[[1], [[[2]]], [[[[[[[3]]]]]]]]]]

# def flatten(arr):

# resultArr = []

# for item in arr:

# if type(item) is list:

# resultArr.extend(flatten(item))

# else:

# resultArr.append(item)

# return resultArr

# print(flatten(arr))

# def isOdd(n):

# if n%2 ==0:

# return False

# return True

# arr = [12,4,4]

# def someRecursive(arr, cb):

# if len(arr)==0:

# return False

# if not(cb(arr[0])):

# return someRecursive(arr[1:], cb)

# else:

# return True

# print(someRecursive(arr, isOdd))

# def isPalindrome(name):

# if len(name)==0:

# return True

# if name[0]!=name[-1]:

# return False

# return isPalindrome(name[1:-1])

# print(isPalindrome("tacocat"))

# print(isPalindrome("amanaplanacanalpanama"))

# print(isPalindrome("amanaplanacanalpandemonium"))

# def reverse(name):

# if len(name)==0:

# return ""

# return reverse(name[1:]) + name[0]

# print(reverse("YUG"))

# def recursiveRange(n):

# if n==0:

# return 0

# return n + recursiveRange(n-1)

# print(recursiveRange(3))

# arr = [12,3,4]

# def prodOfArr(arr):

# if len(arr)==0:

# return 1

# return arr[0] * prodOfArr(arr[1:])

# print(prodOfArr(arr))

# def factorial(n):

# if n==0:

# return 1

# else:

# return n*factorial(n-1)

# print(factorial(5))

# def toBinary(n):

# # print("hhh")

# # print(n)

# # print(n%2)

# if n==0:

# return 0

# else:

# return (n%2) + 10*toBinary(int(n/2))

# print(toBinary(13))

# def GCD(a, b):

# # Euclidean theorem

# assert int(a)==a and int(b)==b, "Only integers are allowed"

# if a<0:

# a*=(-1)

# if b<0:

# b*=(-1)

# if b==0:

# return a

# return GCD(b, a%b)

# print(GCD(18,49))

# def power(x, n):

# assert int(n)==n, "exponent must be integer"

# if n==0:

# return 1

# else:

# return x*power(x, n-1)

# print(power(5.3,5))

# def digitsSum(n):

# assert n>=0 and int(n)==n, "number has to be positive integer"

# if n==0:

# return 0

# else:

# return n%10 + digitsSum(int(n/10))

# print(digitsSum(1993))

# def factorial(n):

# if (n==0):

# return 1;

# else:

# return n*factorial(n-1);

# def fibonacci(n):

# if n==0:

# return 0;

# elif n==1:

# return 1;

# else:

# return fibonacci(n-1) + fibonacci(n-2)

# print(factorial(6))

# print(fibonacci(7))