不論是大學畢業想要找工作、或是正在抉擇碩班的領域,抑或是回心轉意回到資訊領域的懷抱,都可以參考這一篇分享。 前提是,你確定目前的你在未來打算在資訊領域打滾一陣(輩)子。 那這篇會非常非常適合你參考看看。
這篇分享是依據自己的經驗,給自己下的一些小結論,希望分享給大家,讓大家可以少走一點坎坷路。 至於自己的坎坷嘛!就只會在 2018/12/08 這天有機會分享給大家拉!
# 370. Range addition | |
updates = [[1,3,2],[2,4,3],[0,2,-2]] | |
length = 5 | |
# [-2,0,3,5,3] | |
initial_arr = [0]*length | |
for i in updates: | |
#print(i) | |
s,d,inc = i[0],i[1],i[2] | |
print(s,d,inc) |
weight = [4,5,6,2,2] | |
value = [6,4,5,3,6] | |
W = 8 # 負重 | |
num = len(value) | |
# or num = len(weight) | |
# ans = 15 # 最大價值 | |
# 0 1 2 3 4 5 6 7 8 |
# 0-1 Knapsack Problem 0-1 背包問題 | |
''' | |
[0, 0, 0, 0, 0, 0, 0, 0, 0] | |
[0, 0, 0, 0, 6, 6, 6, 6, 6] | |
[0, 0, 0, 0, 6, 6, 6, 6, 6] | |
[0, 0, 0, 0, 6, 6, 6, 6, 6] | |
[0, 0, 3, 3, 6, 6, 9, 9, 9] | |
[0, 0, 6, 6, 9, 9, 12, 12, 15] | |
ans: [0, 0, 6, 6, 9, 9, 12, 12, 15] | |
''' |
class Solution: | |
def countAndSay(self, n: int) -> str: | |
if n==1: | |
return "1" | |
first = 0 | |
test = str(1) | |
for j in range(2,n+1): | |
ans = "" |
def combinations(data, length): | |
def dfs(cur, pos): | |
if len(cur) == length: | |
yield cur | |
if pos == len(data): | |
return | |
if type(data) is list: | |
for i in range(pos, len(data)): | |
for j in dfs(cur + [data[i]], i + 1): | |
yield j |
class Solution: | |
def rotate(self, matrix: List[List[int]]) -> None: | |
""" | |
Do not return anything, modify matrix in-place instead. | |
""" | |
for i in range(len(matrix)): | |
for j in range(i+1,len(matrix)): | |
matrix[i][j],matrix[j][i] = matrix[j][i],matrix[i][j] | |
for k in range(len(matrix)): |
''' | |
Ex: | |
talentsCount = 3 | |
talent=[1,2,3,2,1] | |
''' | |
''' | |
talent=[1,2,3,2,1] | |
talentsCount = 3 | |
''' | |
talent=[1,1,2,2,3,1,3,2] |
'''Ex | |
testStr = "423692" | |
kb = "923857614" | |
''' | |
'''ex1 | |
testStr = "5111" | |
kb = "752961348" | |
''' |