入坑codewars第一天-Invert values、String repeat、List Filtering
今天導師給開了會讓我們每天在codewars上至少刷兩道題,提高自己的python程式設計能力。不刷不知道一刷嚇一跳。果然自己的程式設計能力很菜。實踐出真知。
一、題目
題目說明:就是將列表中所有的取反,題目很簡單,但是我不太會運用python程式碼
二、求解
就是一個for迴圈,利用了python程式碼獨有的列表推導
[-i for i in lst]意思是lst列表中所有數取反。雖然我知道有這個,但是我一開始不知道怎麼用。果然還是要多實踐。
第二題:
題目:
題二:
很簡單就是重複輸出;
第三題:
題目:就是將列表中的字元刪除,一開始我用for迴圈刪除發現總是有字元無法刪除的情況,刪不乾淨應該是因為for迴圈中刪除了字串後編號又往後移了,並且列表長度又變短了,導致漏讀了。因此會漏刪。
後來到網上查詢發現有一種方法很巧妙:
思路:
1、首先用一個空的列表把字串存在新的列表中。
x=[]
for i in l:
if type(i)==type(''):
x.append(i)
2、然後在要處理的列表中刪除x字串列表中的字元
for i in x:
l.remove(i)
綜上:
相關推薦
入坑codewars第一天-Invert values、String repeat、List Filtering
今天導師給開了會讓我們每天在codewars上至少刷兩道題,提高自己的python程式設計能力。不刷不知道一刷嚇一跳。果然自己的程式設計能力很菜。實踐出真知。 一、題目 題目說明:就是將列表中所有的取反,題目很簡單,但是我不太會運用python程式碼 二、求解 就是一個fo
入坑codewars第二天-Basic Mathematical Operations、Ones and Zeros
一、題目 需要實現 +對應加法 需要實現 -對應減法 …… 以此類推 二、求解 簡單的if語句 二、題二 題意就是:將列表中的數字看成一串二進位制然後轉成十進位制數 我的思路是:先把列表顛倒,這裡注意列表a,a.rev
入坑codewars第三天-Build a pile of Cubes、Convert boolean values to strings 'Yes' or 'No'、Build Tower
第一題: Build a pile of Cubes: Your task is to construct a building which will be a pile of n cubes. The cube at the bottom will have a volume of n
入坑codewars第十天-Product of consecutive Fib numbers、longest_palindrome
題目: The Fibonacci numbers are the numbers in the following integer sequence (Fn): 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,
入坑codewars第七天-Maximum subarray sum、Are they the “same”?
題目: 題意:求連續子序列的和的最大值 思路:笨方法一個一個求:首先求第一個數分別加後面的數取一個最大值 然後下一個數分別加後面的數取最大值 以此類推…… 程式碼如下: def maxSequence(arr): maxsum=0
入坑codewars第六天-Highest Scoring Word、The Supermarket Queue
題目: Given a string of words, you need to find the highest scoring word. Each letter of a word scores points according to it's position in the al
入坑codewars第五天-Dubstep、Regex validate PIN code
第一題: 題目: Polycarpus works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to
入坑codewars第四天-Delete occurrences of an element if it occurs more than n times
第一題: Enough is enough! Alice and Bob were on a holiday. Both of them took many pictures of the places they've been, and now they want to show Char
入前端坑的第一天
考慮了很久,還是決定要轉行了。 首先給自己定的方向是計算機相關,但是方向有很多,前端、JAVA、大資料等等等等。 查了很久資料,比較了這些所需的基礎與要學的技術棧,還是選擇了入門最簡單的前端。 與其他方向不同,前端的學習曲線是前緩後陡,由於自己並無經驗,視覺化的進步恰恰可做為自己前進的動力。 &nbs
入坑codewars第18天-Alphabet wars - nuclear strike
題目:Alphabet wars - nuclear strike Introduction There is a war and nobody knows - the alphabet war! The letters hide in their nuclear shelters. T
入坑codewars第17天-Directions Reduction
題目: Once upon a time, on a way through the old wild west,… … a man was given directions to go from one point to another. The directions were "NO
入坑codewars第16天-Transformation of a Number Through Prime Factorization
題目: Every natural number, n, may have a prime factorization like: We define the geometric derivative of n, as a number with the fol
入坑codewars第15天-Regexp Basics - is it IPv4 address?
題目: Implement String#ipv4_address?, which should return true if given object is an IPv4 address - four numbers (0-255) separated by dots. I
入坑codewars第14天-Where is my parent!?(cry)
題目: Mothers arranged dance party for children in school.On that party there are only mothers and their children.All are having great fun on dancin
入坑codewars第13天- Dashatize it
第一題: Given a number, return a string with dash'-'marks before and after each odd integer, but do not begin or end the string with a dash mark. E
入坑codewars第12天-Best travel
題目一: John and Mary want to travel between a few towns A, B, C ... Mary has on a sheet of paper a list of distances between these towns. ls =
入坑codewars第11天-Clock in Mirror
題目一: Peter can see a clock in the mirror from the place he sits in the office. When he saw the clock shows 12:22 He knows that the time is 11:38
入坑codewars第八天-Help the bookseller !
今天只寫了一道題不容易呀,實在不懂輸出格式,於是想辦法湊出來的…… 題目: A bookseller has lots of books classified in 26 categories labeled A, B, ... Z. Each book has a code c of
Python第一天:編程的概念、python的介紹與安裝、python的變量、python的運算符
代碼 .com 循環輸出 html targe .cn 次循環 概念 9.png 一、內容 二、練習: 1、使用while循環輸出1、2、3、4、5、6、8、9、10 方法一:說明:當count 等於7時,count加1,此時count的值為8,然後continu
Hibernate第一天(Hibernate的環境搭建、Hibernate的API、Hibernate的CRUD)
Hibernate的入門(Hibernate的環境搭建、Hibernate的API、Hibernate的CRUD) 以前學習過Hibernate,不過學習的不太紮實,做的專案也不太多,好久時間沒用,都快忘得差不多了,今天重新學習一下,一步一個腳印的敲每個程式碼,爭取把Hibernate徹底學