This is a note for python study.
The Lambda can use a function by one line code.
For example, below add function is two lines as below.
![[Study][Python] lambda](https://miro.medium.com/fit/c/224/224/1*F5oxRO_CIAQH9kqSlNWuyw.png)
![[Study][Python] lambda](https://miro.medium.com/fit/c/112/112/1*F5oxRO_CIAQH9kqSlNWuyw.png)
def add_up(x,y):
return x+yWe can re-write one line as below.
add_up = lambda x, y:x+yThe result is the same.
In recent months, I join the crypto investigation. Below is my crypto exchange list.
If you use TWD, you can buy USDT and send them to other exchange to buy other coins such as BTC, ETH… This is for rookie.
Staking Max coin apy is 2% to…
![[LeetCode]#1822. Sign of the Product of an Array](https://miro.medium.com/fit/c/224/224/1*ydbHtYdg2nsa-3JKxZO7ew.png)
![[LeetCode]#1822. Sign of the Product of an Array](https://miro.medium.com/fit/c/112/112/1*ydbHtYdg2nsa-3JKxZO7ew.png)
Environment: Python 3.8
Key technique: for, if
There is a function signFunc(x) that returns:
1 if x is positive.-1 if x is negative.0 if x is equal to 0.You are given an integer array nums. Let product be the product of all values in the array nums.
…
![[LeetCode]#2124. Check if All A’s Appears Before All B’s](https://miro.medium.com/fit/c/224/224/1*ubfXTc_ciLI25eVeLgmMCA.png)
![[LeetCode]#2124. Check if All A’s Appears Before All B’s](https://miro.medium.com/fit/c/112/112/1*ubfXTc_ciLI25eVeLgmMCA.png)
Environment: Python 3.8
Key technique: if
Given a string s consisting of only the characters 'a' and 'b', return true if every 'a' appears before every 'b' in the string. Otherwise, return false.
Example 1:
Input: s = "aaabbb"
Output: true
Explanation:
The 'a's are at indices 0, 1, and 2, while the…![[LeetCode]#2119. A Number After a Double Reversal](https://miro.medium.com/fit/c/224/224/1*wTrXErk3p1sxPiMl0l9KVw.png)
![[LeetCode]#2119. A Number After a Double Reversal](https://miro.medium.com/fit/c/112/112/1*wTrXErk3p1sxPiMl0l9KVw.png)
Environment: Python 3.8
Key technique: str(), int()
Reversing an integer means to reverse all its digits.
2021 gives 1202. Reversing 12300 gives 321 as the leading zeros are not retained.Given an integer num, reverse num to get reversed1, then reverse reversed1 to get reversed2. Return true…
![[LeetCode]#2114. Maximum Number of Words Found in Sentences](https://miro.medium.com/fit/c/224/224/1*qGL0vD8kkdUEU_1w2PedbA.png)
![[LeetCode]#2114. Maximum Number of Words Found in Sentences](https://miro.medium.com/fit/c/112/112/1*qGL0vD8kkdUEU_1w2PedbA.png)
![[LeetCode]#2068. Check Whether Two Strings are Almost Equivalent](https://miro.medium.com/fit/c/224/224/1*4Da_ZAw7cVV3_U5i9EsWGA.png)
![[LeetCode]#2068. Check Whether Two Strings are Almost Equivalent](https://miro.medium.com/fit/c/112/112/1*4Da_ZAw7cVV3_U5i9EsWGA.png)
![[LeetCode]#2108. Find First Palindromic String in the Array](https://miro.medium.com/fit/c/224/224/1*yrEwCeNEy3vG4BXccUjxdQ.png)
![[LeetCode]#2108. Find First Palindromic String in the Array](https://miro.medium.com/fit/c/112/112/1*yrEwCeNEy3vG4BXccUjxdQ.png)
Environment: Python 3.8
Key technique: for, [::-1]
Given an array of strings words, return the first palindromic string in the array. If there is no such string, return an empty string "".
A string is palindromic if it reads the same forward and backward.
Example 1:
Input: words = ["abc","car","ada","racecar","cool"]
Output…![[LeetCode]#2042. Check if Numbers Are Ascending in a Sentence](https://miro.medium.com/fit/c/224/224/1*Y81wQnYhtGyDNgP1_XPHxg.png)
![[LeetCode]#2042. Check if Numbers Are Ascending in a Sentence](https://miro.medium.com/fit/c/112/112/1*Y81wQnYhtGyDNgP1_XPHxg.png)
![[LeetCode]#2103. Rings and Rods](https://miro.medium.com/fit/c/224/224/0*E7wMQIYyKkEVRHDa.png)
![[LeetCode]#2103. Rings and Rods](https://miro.medium.com/fit/c/112/112/0*E7wMQIYyKkEVRHDa.png)
