我如何在昌迪加爾大學中心組織Google Hash Code 2019

by Neeraj Negi

由Neeraj Negi

我如何在昌迪加爾大學中心組織Google Hash Code 2019 (How I organized Google Hash Code 2019 at Chandigarh University Hub)

This is me !!! @Neeraj Negi — Google HashCode Organizer

這就是我 !!! @Neeraj Negi-Google HashCode組織者

“Organizing the event is not a big deal but handling and making it successful is”- Nj

“組織這次活動沒什么大不了,但是處理并使其成功是重要的”-Nj

Over 900+ students participated in Google HashCode2019 from “Chandigarh University Hub”. I am writing this so that my peers and fellow juniors can learn something from my experience because in life we don’t have enough time to fall and then learn. I hope you will enjoy this and learn how I was able to manage this event.

超過900多名學生從“ 昌迪加爾大學中心”參加了Google HashCode2019 。 我寫這本書的目的是為了使我的同學和初中同學可以從我的經驗中學習一些東西, 因為在生活中我們沒有足夠的時間去摔倒和學習 。 希望您會喜歡上它,并了解我如何能夠管理此活動。

So the story starts with getting notification from Google about “Google HashCode 2019”. I live in the beautiful city of Chandigarh, India and am currently pursuing my Bachelors in Computer Science & Engineering. Being a Google Web Specialist Scholar and Google Pytorch Scholar, I was able to get the notification about GH19 earlier via communication. ?

因此,故事首先要從Google獲得有關“ Google HashCode 2019”的通知。 我住在印度美麗的昌迪加爾市,目前正在攻讀計算機科學與工程學士學位。 作為Google網絡專家學者Google Pytorch學者,我能夠通過通訊較早地獲得有關GH19的通知。 ?

關于我的一點 (A little bit about me)

I have already handled many huge events but this particular event has been one of the biggest — not only in terms of student engagement, but also in terms of expectations. I was very excited about the event and I also wanted to participate in the hashcode Competition in spite of being an organizer. I am a member of Women Tech-Makers by Google, Google Developer Group- Chandigarh, AWS Educate Member, 1MWIT, Linkedin Local, Adobe Club Member and in many other clubs hosted by the university.

我已經處理了許多大型活動,但這項特殊活動是最大的活動之一-不僅在學生參與度方面,而且在期望方面。 我對該活動感到非常興奮,并且盡管想成為組織者,但我也想參加哈希碼競賽。 我是Google的Google Tech Tech-Makers 成員,Chandigarh的Google Developer Group,AWS Educate成員,1MWIT,Linkedin Local,Adobe Club成員以及該大學主辦的許多其他俱樂部的成員

Background: I am a Full stack web developer (MEAN Stack) |UI/UX -Web Design | Voice-Recognition Developer | Founder of Business Targeting |Linkedin Enthusiast | Google Adwords Certified | Alexa Skill and Google Assistant Developer| Mentor of 1millionWomen in Tech |Adobe Campus Representative | Working on Self Driving Cars (ML, AI) |CompTIA+| Working on AWS I have already gotten my hands dirty with C, C++, and Python during my High School years and have learned new programming languages like Java, JavaScript, Node.Js, Angular.Js in University. My natural curiosity led me towards the field of web development and self-driving cars. I have ongoing research on deep neural networks.

背景: 我是全棧Web開發人員(MEAN Stack)| UI / UX -Web設計| 語音識別開發人員| 業務定位創始人| LinkedIn熱心者| Google Adwords認證| Alexa Skill和Google助理開發人員| 100萬女性技術顧問| Adob??e校園代表| 從事自動駕駛汽車(ML,AI)| CompTIA + | 在AWS上工作 在高中時期,我已經開始接觸C,C ++和Python,并在大學學習了新的編程語言,例如Java,JavaScript,Node.Js,Angular.Js。 我的自然好奇心使我進入了Web開發和自動駕駛汽車領域。 我正在進行有關深度神經網絡的研究。

So now let’s go back to the story. ? Most of the students in my university were not aware of the Google hashcode Competition. So I decided to spread some awareness to the students and convince them to participate so that they could learn something from real-world problems. Even if they didn’t know how to write <<hello world; they could still research and start exploring.

現在讓我們回到故事。 ? 我大學的大多數學生都不知道Google哈希碼競賽。 因此,我決定向學生傳播一些意識,并說服他們參加,以便他們可以從現實問題中學習一些東西。 即使他們不知道如何寫《你好世界》; 他們仍然可以研究并開始探索。

“Research is to see what everybody else has seen and to think what nobody else has thought. — Albert Szent-Gyorgyi”

“研究是要看到其他人看到的東西,并思考其他人沒有想到的東西。 —阿爾伯特·圣特·喬吉

Google HashCode-比賽時間| HashCode集線器| 儀表板| 團隊組成 (Google HashCode — Competition Timing | HashCode Hubs | DashBoard | Team Formation)

A little context, first: Google Hash Code is a programming competition. You get a task from Google, along with a few input files. You’re supposed to write a program that reads an input file and produces an output file which solves the problem. The hard part: you have to do it within 4 hours.

首先,介紹一下上下文:Google哈希代碼是一場編程競賽。 您可以從Google獲得一項任務以及一些輸入文件。 您應該編寫一個程序來讀取輸入文件并生成一個輸出文件來解決問題。 困難的部分:您必須在4小時內完成。

Online Qualification Round The initial online based Qualification Round was held on Thursday, February 28, 2019, from 17:30 UTC until 21:30 UTC.

在線資格賽首輪基于資格賽的在線比賽于2019年2月28日(星期四)世界標準時間17:30至21:30舉行。

Reason to participate:

參加理由:

Whether you’re new to programming or a coding competition pro, there are plenty of reasons to participate in Hash Code. Lindsay Taub, my mentor, put it best:

無論您是編程新手還是編碼競賽專業人士,都有很多理由參與哈希碼。 我的導師Lindsay Taub 表現得最好 :

  1. Optimization problems for the win. Just like the problems that Google engineers tackle, there’s never one right answer to a Hash Code problem. Instead, each round of the competition is designed as a “battle of heuristics” — imperfect solutions. There are many ways to approach the challenge, and teams should continuously iterate on their solution throughout the round. Getting familiar with past problems is the best way to prepare; always hold a practice session (or two) with your team using the Hash Code archive.

    優化問題為贏。 就像Google工程師要解決的問題一樣,哈希碼問題從來沒有一個正確的答案。 取而代之的是,每輪比賽都被設計為“啟發式戰斗”,即不完善的解決方案。 解決挑戰的方法很多,團隊應在整個回合中不斷迭代解決方案。 熟悉過去的問題是最好的準備方法。 始終使用Hash Code 存檔與您的團隊進行一次(或兩次)練習。

  2. Hash Code is all about community. From competing on a team of two to four people to participating in the competition from a Hash Code hub (a local meetup that you can organize), opportunities to connect with other Hash Coders are everywhere. This is the first year Hash Code is open to developers globally, and we’re excited to see this community continue to grow. Meet other Hash Coders, find teammates and stay up-to-date on all the latest Hash Code buzz.

    哈希碼與社區有關。 從一個由兩到四個人組成的團隊競爭到從哈希碼中心 ( 您可以組織的本地聚會)參加競賽,到處都有與其他哈希碼聯系的機會。 這是Hash Code向全球開發人員開放的第一年,我們很高興看到這個社區繼續增長。 與其他Hash Coder會面,尋找隊友并保持最新的所有Hash Code嗡嗡聲。

  3. Googley fun. Hash Code is an opportunity to get a glimpse into software engineering at Google, and when our teams come together to solve challenging problems, you can bet they have some fun while doing it.

    Googley的樂趣。 哈希碼是一個了解Google軟件工程的機會,當我們的團隊團結起來解決具有挑戰性的問題時,您可以打賭他們在這樣做的過程中會很有趣。

  4. Learning and learning. If problems are solved by you or not! you always get some benefits by learning new things, getting familiar with new tools and methods. You can’t learn these things without participating so if you did your best, kudos to you.

    學習和學習。 問題是否由您解決! 通過學習新事物,熟悉新工具和新方法,您總是會得到一些好處。 沒有參與您就無法學習這些東西,因此,如果您盡力而為,就對您表示敬意。

You never lose…. either you win or you learn.
你永遠不會輸…。 你贏了還是學到了。

The best way to experience the Hash Code is to discover it for yourself. ?

體驗哈希碼的最佳方法是親自發現它。 ?

Here are some of the photographs taken on that day!

這是當天拍攝的一些照片!

以下是我想回答的一些問題: (Here are some questions I would like to answer:)

  1. Why did I choose to organize a hub at Chandigarh University?

    我為什么選擇在昌迪加爾大學組織中心?

I chose to organize a hub here at CU is because I felt that providing an opportunity for people to come together and work on a challenging problem is the best way to let them develop their skills and themselves. Hub gives you a platform so that you can showcase your coding talent and at the same time learn something from others too.

我之所以選擇在CU組織中心,是因為我認為為人們提供一個聚會和解決難題的機會是讓他們發展技能和自我的最佳途徑。 Hub為您提供了一個平臺,使您可以展示自己的編碼才能,同時也可以從他人那里學到一些東西。

2. What was the process of setting up my hub?

2.設置我的中心的過程是什么?

There were so many things to do, like booking a room, Labs, getting approvals from our university, and ensuring Wifi was set up. At that time I was expecting around 400–500 participants but the count went way beyond that... I booked 2 Seminar halls and 14 Computer labs containing 36 PCs each for participants on that day. But later I booked 4 more rooms and that's how I managed to put all the students in one block. Getting permission for rooms for a night was one of the hardest parts, but thanks to my supportive friends I was able to do it.

有很多事情要做,例如預訂房間,實驗室,獲得我們大學的批準以及確保建立Wifi。 當時我預計會有400-500名參與者,但是人數遠遠超出了……那天我預定了2個研討會廳和14個計算機實驗室,每個實驗室有36臺PC。 但是后來我又訂了4個房間,這就是我設法將所有學生都放在一個街區的方法。 獲得一晚房間的許可是最難的部分之一,但是由于我的支持者朋友,我才得以做到。

We also started promoting the event a few weeks earlier to be sure we had as many participants as possible. The real fun started just before the competition when we decorated the room with balloons and posters — luckily a few Volunteers came early so they decided to join us and help!

我們還于幾周前開始宣傳該活動,以確保我們有盡可能多的參與者。 真正的樂趣始于比賽前,當時我們用氣球和海報裝飾了房間-幸運的是,一些志愿者來得很早,所以他們決定加入我們并提供幫助!

3. What was my favorite part about hosting a hub?

3.關于托管集線器,我最喜歡的部分是什么?

Meeting new people! That’s definitely the best part. You can feel the passion and excitement in the room.

結識新朋友! 那絕對是最好的部分。 您可以在房間里感受到熱情和激動。

Students came here not only for coding but for being a part of world level competition.

學生來到這里不僅是為了編碼,而且是參加世界級比賽的一部分。

Thanks, guys for coming here!

謝謝大家來這里!

Google Hashcode前3天 (3 days before Google Hashcode)

規劃 (Planning)

In India, the timing of Google hashcode Competition was 28th Feb at 11 pm at night. So I had to find out the availability of the students at night and also space, decorations, wifi, food resources, and security.

在印度,Google hashcode Competition的時間為2月28日晚上11點。 因此,我不得不找出晚上學生的空閑時間,以及空間,裝飾品,wifi,食物資源和安全性。

The most difficult task was getting permission for a night event. 3 days prior I emailed my department head and UIR about this event so that no problems would occur. They got my email and replied back to me on the same day. The department helped me in arranging the stay of day-scholars and getting permission for hostler to reach our Hub. Then I got help from my university branding department for printing out the Google printable kit for decorations and visitor cards or participants cards.

最困難的任務是獲得夜間活動的許可。 在三天前,我就此事件通過電子郵件發送給了部門主管和UIR,這樣就不會出現任何問題。 他們收到了我的電子郵件,并在同一天回復了我。 該部門幫助我安排了日間學者的住宿,并獲得了招待人進入我們中心的許可。 然后,我從大學品牌部門獲得了幫助,以打印出用于裝飾和訪客卡或參與者卡的Google可打印套件。

I would like to thank the professors, deans and all other faculty members of Chandigarh University who gave me permission for this and helped me in each and every arrangement.

我要感謝昌迪加爾大學的教授,院長和所有其他教職員工,他們為此給予了我許可,并為我的每項安排提供了幫助。

晉升 (Promotion)

We did promotion for 2 days before hashcode by showing posters and flyers on the student portal. We were not expecting that kind of participation from students — my volunteering team told me that for a night event we could assume less than 400 participants.

通過在學生門戶上顯示海報和傳單,我們在進行哈希碼促銷之前進行了2天的促銷活動。 我們沒想到學生會參加這種活動-我的志愿者團隊告訴我,對于一個夜間活動,我們可以假設少于400名參與者。

But I knew that I could engage more than 400 students for this event. So I created a simple presentation describing the event and the benefits of participation. I also created a Google form so that I could get the information about participants.

但是我知道我可以邀請400多名學生參加這次活動。 因此,我創建了一個簡單的演示文稿,描述了該事件以及參與的好處。 我還創建了一個Google表單,以便獲得有關參與者的信息。

裝飾 (Decoration)

The most interesting and eye-catching thing was the decorations. Thanks to my friend ? @Deepika for taking responsibility for the decorations. She helped me a lot during this event and I really appreciate her effort.

最有趣和引人注目的是裝飾品。 多虧我的朋友? @Deepika負責裝飾。 在這次活動中,她為我提供了很多幫助,我非常感謝她的努力。

Also, @Shushant,@Anant @Aditinegi, @ayesha, @itika @priyanka @manish @simran were working on Whiteboard Designing, Balloons and cutting Google sign prints.

此外,@ Shushant,@ Anant @ Aditinegi,@ ayesha,@ itika @priyanka @manish @simran也在從事白板設計,氣球和切割Google標牌的工作。

Thanks for all kinds of efforts you gave to this event!

感謝您為這次活動付出的各種努力!

義工隊 (Volunteering Team)

I am aware that for these kinds of events, you need your own team who can help you to arrange all kinds of stuff so that you can more focus on the core parts.

我知道,對于此類事件,您需要自己的團隊來幫助您安排各種事情,以便您可以更加專注于核心部分。

I have already a team of 150 students, but this time I thought to give this opportunity to new people.

我已經有150名學生,但是這次我想給新朋友這個機會。

It took me 2 days to find the right volunteers and give them the opportunity to grow. Before this, a session was held in the morning with volunteers so that they could be more comfortable and flexible with me!

我花了兩天的時間找到合適的志愿者并給他們成長的機會。 在此之前,早上與志愿者舉行了一次會議,以使他們對我更加舒適和靈活!

What life has taught me is that you can not lead people if they do not respect you, do not trust you, and do not believe you. You can order them around, but to get them to do their best you need to win their hearts.

生活告訴我的是,如果人們不尊重您,不信任您并且不相信您,您將無法領導他們。 您可以命令他們,但是要使他們盡力而為,您需要贏得他們的心。

People do not care how much you know until they know how much you care and can help them solve their problems.

人們不會在乎您知道多少,直到他們知道您在乎多少并可以幫助他們解決問題。

Creating this volunteering team and finding each and every volunteer becomes worth it. Thanks to all the 80+ coordinators who helped me with this event.

創建這個志愿者團隊并找到每一個志愿者變得值得。 感謝所有80多位協調員為我提供了幫助。

Special thanks to @avlin and @ashish @jatin @akhil @kartik and @karan for helping me with setting arrangements.

特別感謝@avlin和@ashish @jatin @akhil @kartik和@karan幫助我進行設置。

I think I was able to make each and everyone volunteer a good leader by guiding them in the right direction.

我認為我能夠通過引導他們朝著正確的方向發展,從而使每個人都成為優秀的領導者。

“Leaders become great not because of their power but, because of their ability to empower others and find out the strength they have.” — John C. Maxwell

“領導者之所以變得出色,并不是因為他們的力量,而是因為他們有能力賦予他人權力并發掘自己的力量。” 約翰·麥克斯韋(John C. Maxwell)

That's what I did!

那就是我所做的!

IST 2019年2月28日 (28th Feb 2019 IST)

At 8:30 pm this was the crowd ?

在晚上8:30,這是人群嗎?

HashCode在線資格賽前的AMA會議! (AMA Session before HashCode Online Qualification Round!)

So before the Google HashCode Competition started, I held a session to get students familiarized with the HashCode Dashboard, Point and ranking system, Optimisation of the problem and input-output logic. I also talked about lots of things other than hashcode and shared my experience with the students.

因此,在Google HashCode競賽開始之前,我舉行了一場會議,讓學生熟悉HashCode儀表板,積分和排名系統,問題的優化和輸入輸出邏輯。 我還討論了除哈希碼以外的許多事情,并與學生們分享了我的經驗。

問題與查詢 (Questions and Queries)

I also took some questions from the students.

我還問了一些學生的問題。

2019年3月1日 (1st March 2019 IST)

Competition started!

比賽開始了!

As the problem was released, all coders started working on their solutions. All the students were busy with the problem statement.

問題釋放后,所有編碼人員都開始著手解決方案。 所有的學生都忙于問題陳述。

好玩 測驗| 音樂游戲| 卡胡特 (Fun | Quiz | Music Game | Kahoot)

After the Hashcode competition, we organized some Quiz and music ball games so that the students did not get bored and stayed connected with the event. It’s important not only to code but also to enjoy the moment.

在Hashcode比賽之后,我們組織了一些測驗和音樂球比賽,以使學生們不會感到無聊,并與比賽保持聯系。 重要的是不僅要編碼,而且要享受這一刻。

Thanks, @sahil, and Nilansh Gupta — these are my friends who were with me while organizing Kahoot, the music ball game, and the AR game. I got feedback from the students and they really enjoyed these games. After the games, the students started taking photographs.

謝謝@sahil和Nilansh Gupta ,這些人是我的朋友,他們一起組織Kahoot,音樂球游戲和AR游戲。 我從學生那里得到了反饋,他們真的很喜歡這些游戲。 比賽結束后,學生們開始拍照。

Thanks to @kashish, @himanngshu boro, and @saurav for taking photographs!

感謝@ kashish,@ himanngshu boro和@saurav拍攝照片!

Kahoot Quiz

Kahoot測驗

Music Game after Hashcode Competition!

哈希碼比賽后的音樂游戲!

At 5:00 am the students went back to their homes.

學生在凌晨5:00返家。

HashCode背后的志愿者團隊 (Volunteer Team Behind HashCode)

I think it is the main responsibility of a Team leader to see the potential in others, to help them develop their strengths they did not even know they had, and give others opportunities to grow and always appreciate them even if it’s a small win by them.

我認為團隊領導者的主要職責是看到他人的潛力,幫助他們發展甚至不知道自己擁有的優勢,并給予他人成長和始終感激他們的機會,即使這只是他們的一次小小的勝利。

It is impossible to be a good leader without being a good person!
沒有一個好人就不可能成為一個好的領導者!

It costs nothing to be respectful, kind, nice, supportive, grateful and positive.

尊重,友善,友善,支持,感恩和積極不需付出任何代價。

“We are not a team because we work together. We are a team because we respect, trust, and care for each other.”

“我們不是團隊,因為我們一起工作。 我們是一個團隊,因為我們彼此尊重,信任和關懷。”

Here was my appreciation message from my side for volunteers at 6am on next day!

第二天早上6點,這是我對志愿者的感謝!

What I learned from my mentors was that “a person who feels appreciated will always do more than what is expected.”

我從導師那里學到的是:“ 一個感到被欣賞的人將永遠比預期做得更多。”

哈希碼競賽后的反饋和回應 (Feedback & Responses After Hash Code Competition)

I got around 300+ appreciation messages for the hashcode event from different platforms. I want to take this moment to thank all the participants and coordinators who were there and joined Google Hashcode 2019 with me. In the future, I will definitely organize another event like this. ?

我從不同的平臺收到了300多個有關hashcode事件的感謝消息。 我想借此機會感謝所有與我一起參加Google Hashcode 2019的參與者和協調員。 將來,我一定會組織另一個這樣的活動。 ?

Thanks, @Lindsay Taub for mentoring me!

謝謝@Lindsay Taub指導我!

Leading is not about winning, but it is about bringing others with you to the finish line. Agree?

領導并不是要贏得勝利,而是要帶別人一起沖向終點。 同意?

Comments and claps are highly appreciated!

評論和拍手表示高度贊賞!

Connect with me on Social Media:

在社交媒體上與我聯系:

Twitter: @realneerajnegi

推特: @realneerajnegi

Linkedin: https://www.linkedin.com/in/neerajnegideveloper/Instagram: https://www.instagram.com/neerajnegi_nj/

Linkedin: https ://www.linkedin.com/in/neerajnegideveloper/ Instagram: https : //www.instagram.com/neerajnegi_nj/

Follow our Hashcode page: Hashcodenj and #HashCodenj

請遵循我們的哈希碼頁面:Hashcodenj和#HashCodenj

https://www.instagram.com/hashcodenj/

https://www.instagram.com/hashcodenj/

翻譯自: https://www.freecodecamp.org/news/google-hash-code-2019-chandigarh-university-hub-organized-by-neeraj-negi-923118fce083/

本文來自互聯網用戶投稿,該文觀點僅代表作者本人,不代表本站立場。本站僅提供信息存儲空間服務,不擁有所有權,不承擔相關法律責任。
如若轉載,請注明出處:http://www.pswp.cn/news/391884.shtml
繁體地址,請注明出處:http://hk.pswp.cn/news/391884.shtml
英文地址,請注明出處:http://en.pswp.cn/news/391884.shtml

如若內容造成侵權/違法違規/事實不符,請聯系多彩編程網進行投訴反饋email:809451989@qq.com,一經查實,立即刪除!

相關文章

leetcode 665. 非遞減數列(貪心算法)

給你一個長度為 n 的整數數組&#xff0c;請你判斷在 最多 改變 1 個元素的情況下&#xff0c;該數組能否變成一個非遞減數列。 我們是這樣定義一個非遞減數列的&#xff1a; 對于數組中所有的 i (0 < i < n-2)&#xff0c;總滿足 nums[i] < nums[i 1]。 示例 1: …

django基于存儲在前端的token用戶認證

一.前提 首先是這個代碼基于前后端分離的API,我們用了django的framework模塊,幫助我們快速的編寫restful規則的接口 前端token原理: 把(token加密后的字符串,keyname)在登入后發到客戶端,以后客戶端再發請求,會攜帶過來服務端截取(token加密后的字符串,keyname),我們再利用解密…

數據分布策略_有效數據項目的三種策略

數據分布策略Many data science projects do not go into production, why is that? There is no doubt in my mind that data science is an efficient tool with impressive performances. However, a successful data project is also about effectiveness: doing the righ…

cell 各自的高度不同的時候

1, cell 根據文字、圖片等內容&#xff0c;確定自己的高度。每一個cell有自己的高度。 2&#xff0c;tableView 初始化 現實的時候&#xff0c;不是從第一個cell開始顯示&#xff0c;&#xff08;從第二個&#xff1f;&#xff09;&#xff0c;非非正常顯示。 a:cell 的高度問題…

leetcode 978. 最長湍流子數組(滑動窗口)

當 A 的子數組 A[i], A[i1], …, A[j] 滿足下列條件時&#xff0c;我們稱其為湍流子數組&#xff1a; 若 i < k < j&#xff0c;當 k 為奇數時&#xff0c; A[k] > A[k1]&#xff0c;且當 k 為偶數時&#xff0c;A[k] < A[k1]&#xff1b; 或 若 i < k < j&…

spring boot源碼下載地址

github下載&#xff1a; https://github.com/spring-projects/spring-boot/tree/1.5.x git地址&#xff1a; https://github.com/spring-projects/spring-boot.git 因為項目中目前使用的就是spring boot 1.5.19版本&#xff0c;因此這里先研究spring boot 1.5版本源碼.轉載于:h…

java基礎學習——5、HashMap實現原理

一、HashMap的數據結構 數組的特點是&#xff1a;尋址容易&#xff0c;插入和刪除困難&#xff1b;而鏈表的特點是&#xff1a;尋址困難&#xff0c;插入和刪除容易。那么我們能不能綜合兩者的特性&#xff0c;做出一種尋址容易&#xff0c;插入刪除也容易的數據結構&#xff1…

看懂nfl定理需要什么知識_NFL球隊為什么不經常通過?

看懂nfl定理需要什么知識Debunking common NFL myths in an analytical study on the true value of passing the ball在關于傳球真實價值的分析研究中揭穿NFL常見神話 Background背景 Analytics are not used enough in the NFL. In a league with an abundance of money, i…

Docker初學者指南-如何創建您的第一個Docker應用程序

您是一名開發人員&#xff0c;并且想要開始使用Docker&#xff1f; 本文是為您準備的。 (You are a developer and you want to start with Docker? This article is made for you.) After a short introduction on what Docker is and why to use it, you will be able to cr…

mybatis if-else(寫法)

mybaits 中沒有else要用chose when otherwise 代替 范例一 <!--批量插入用戶--> <insert id"insertBusinessUserList" parameterType"java.util.List">insert into business_user (id , user_type , user_login )values<foreach collection…

spring—攔截器和異常

SpringMVC的攔截器 SpringMVC攔截器-攔截器的作用 Spring MVC 的攔截器類似于 Servlet 開發中的過濾器 Filter&#xff0c;用于對處理器進行預處理和后處理。 將攔截器按一定的順序聯結成一條鏈&#xff0c;這條鏈稱為攔截器鏈&#xff08;InterceptorChain&#xff09;。在…

29/07/2010 sunrise

** .. We can only appreciate the miracle of a sunrise if we have waited in the darkness .. 人們在黑暗中等待著&#xff0c;那是期盼著如同日出般的神跡出現 .. 附&#xff1a;27/07/2010 sunrise ** --- 31 July 改動轉載于:https://www.cnblogs.com/orderedchaos/archi…

密度聚類dbscan_DBSCAN —基于密度的聚類方法的演練

密度聚類dbscanThe idea of having newer algorithms come into the picture doesn’t make the older ones ‘completely redundant’. British statistician, George E. P. Box had once quoted that, “All models are wrong, but some are useful”, meaning that no model…

node aws 內存溢出_在AWS Elastic Beanstalk上運行生產Node應用程序的現實

node aws 內存溢出by Jared Nutt賈里德努特(Jared Nutt) 在AWS Elastic Beanstalk上運行生產Node應用程序的現實 (The reality of running a production Node app on AWS Elastic Beanstalk) 從在AWS的ELB平臺上運行生產Node應用程序兩年的經驗教訓 (Lessons learned from 2 y…

Day2-數據類型

數據類型與內置方法 數據類型 數字字符串列表字典元組集合字符串 1.用途 用來描述某個物體的特征&#xff1a;姓名&#xff0c;性別&#xff0c;愛好等 2.定義方式 變量名 字符串 如&#xff1a;name huazai 3.常用操作和內置方法 1.按索引取值&#xff1a;&#xff08;只能取…

嵌套路由

父組件不能用精準匹配&#xff0c;否則只組件路由無法展示 轉載于:https://www.cnblogs.com/dianzan/p/11308146.html

leetcode 992. K 個不同整數的子數組(滑動窗口)

給定一個正整數數組 A&#xff0c;如果 A 的某個子數組中不同整數的個數恰好為 K&#xff0c;則稱 A 的這個連續、不一定獨立的子數組為好子數組。 &#xff08;例如&#xff0c;[1,2,3,1,2] 中有 3 個不同的整數&#xff1a;1&#xff0c;2&#xff0c;以及 3。&#xff09; …

從完整的新手到通過TensorFlow開發人員證書考試

I recently graduated with a bachelor’s degree in Civil Engineering and was all set to start with a Master’s degree in Transportation Engineering this fall. Unfortunately, my plans got pushed to the winter term because of COVID-19. So as of January this y…

微信開發者平臺如何編寫代碼_編寫超級清晰易讀的代碼的初級開發者指南

微信開發者平臺如何編寫代碼Writing code is one thing, but writing clean, readable code is another thing. But what is “clean code?” I’ve created this short clean code for beginners guide to help you on your way to mastering and understanding the art of c…

【轉】PHP面試題總結

PHP面試總結 PHP基礎1&#xff1a;變量的傳值與引用。 2&#xff1a;變量的類型轉換和判斷類型方法。 3&#xff1a;php運算符優先級&#xff0c;一般是寫出運算符的運算結果。 4&#xff1a;PHP中函數傳參&#xff0c;閉包&#xff0c;判斷輸出的echo&#xff0c;print是不是函…