꿈꾸는공학도

https://leetcode.com/problems/build-array-from-permutation/Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0  and return it.A zero-based permutation nums is an array of distinct integers from 0 to nums.length - 1 (inclusive). Example 1:Input: nums = [0,2,1,5,3,4]Output: [0,1,2,4,5,3]Explanation: The array ans is built a..

https://leetcode.com/problems/remove-element/description/Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things:Change ..

https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums.Consider the number of unique elements of nums to be k, to get accepte..

https://leetcode.com/problems/longest-substring-without-repeating-characters/description/Given a string s, find the length of the longest substring without repeating characters. Example 1:Input: s = "abcabcbb"Output: 3Explanation: The answer is "abc", with the length of 3.Example 2:Input: s = "bbbbb"Output: 1Explanation: The answer is "b", with the length of 1.Example 3:Input: s = "pwwkew"Output..

모르는 것 위주로 기록을 좀 남기려고 한다. if, while, for문 특성은 뭐, 찾아보면 나오니 큰 어려움 없는데 break, continue 요런 건 지나가면 까먹는 용어라 한 번 메모 해볼법하다. 기본적으로 While문의 구조는 아래와 같다. while 조건문 : 실행문 조건문은 True or False 불형식의 답이 나오게 설정을 해야하며 여기서 조건문이 Ture이면 실행문을 계속 뺑뺑이를 돌리는 거다. while True : print('안녕') *흔히 말하는 무한루프 while문에 쓰이는 치트키 2가지가 바로 1. Break While문을 돌다가 어찌어찌 Break를 만나면 그 순간 그가 속한 While문을 깨고 나온다. coffee = 10 돈 = 100 while 돈 : print('돈..