전체 글 (261)
AI Bootcamp/JavaScript/ [JavaScript] script 작성 위치 정리
2022-01-29 01:34:14
반응형

See the Pen JavaScript_Basic by DevYJShin (@devyjshin) on CodePen.

 

 

 

script 작성은 <head></head>에서 작성하는 것을 많이 사용한다.

 

<html>
<head>

	<script></script>	<!-- 1. 가장 많이 사용 -->
    
    <script src = "scripttest.js"></script> <!-- 2. 외부에서 가져올 경우 -->
</head>
<body>


	<script></script>   <!-- 3.  body 안에서 scipt 작성할 경우 하단 </body> 전에 작성  
    					페이지 로딩을 더 빠르게 하기 위해 어중간한 위치면 
                        		Java Script 때문에 페이지 열리는 속도가 느려짐 -->
</body>
</html>
반응형

'AI Bootcamp > JavaScript' 카테고리의 다른 글

[JavaScript] Variable  (0) 2022.01.29
[JavaScript] Data Type 기본형 & 참조형 & Class 정리  (0) 2022.01.29
[JavaScript] script 작성 위치 정리 2  (0) 2022.01.29
Github/ [Github] Contribution Color Graph
2022-01-28 05:18:57
반응형

아래 링크에서 크롬 확장 설치

https://github.com/williambelle/github-contribution-color-graph

 

GitHub - williambelle/github-contribution-color-graph: Change colors of contribution graph in GitHub.

Change colors of contribution graph in GitHub. Contribute to williambelle/github-contribution-color-graph development by creating an account on GitHub.

github.com

 

반응형

'Github' 카테고리의 다른 글

[GITHUB] Commit 날짜 변경하는 방법 정리(feat. 비어있는 칸 잔디심기)  (0) 2022.06.28
[Github] Activity Overview 설정  (0) 2022.01.28
[Github] Commit Graph 3D  (0) 2022.01.28
[Github] 잔디 먹는 뱀 만들기  (0) 2022.01.01
Github/ [Github] Activity Overview 설정
2022-01-28 05:11:57
반응형

 

1.  우측 상단 모서리에 프로필 사진 클릭한 다음 내 프로필 클릭

 

2. Contribution settings → Private contributions & Activity overview check

 

https://docs.github.com/en/enterprise-server@3.1/account-and-profile/setting-up-and-managing-your-github-profile/managing-contribution-graphs-on-your-profile/showing-an-overview-of-your-activity-on-your-profile

 

Showing an overview of your activity on your profile - GitHub Docs

 

docs.github.com

 

반응형

'Github' 카테고리의 다른 글

[GITHUB] Commit 날짜 변경하는 방법 정리(feat. 비어있는 칸 잔디심기)  (0) 2022.06.28
[Github] Contribution Color Graph  (0) 2022.01.28
[Github] Commit Graph 3D  (0) 2022.01.28
[Github] 잔디 먹는 뱀 만들기  (0) 2022.01.01
Github/ [Github] Commit Graph 3D
2022-01-28 04:57:24
반응형

1일 1커밋 습관화합시다 !!

https://github.com/jasonlong/isometric-contributions

 

GitHub - jasonlong/isometric-contributions: Browser extension for rendering an isometric pixel art version of your GitHub contri

Browser extension for rendering an isometric pixel art version of your GitHub contribution graph. - GitHub - jasonlong/isometric-contributions: Browser extension for rendering an isometric pixel ar...

github.com

 

반응형

'Github' 카테고리의 다른 글

[GITHUB] Commit 날짜 변경하는 방법 정리(feat. 비어있는 칸 잔디심기)  (0) 2022.06.28
[Github] Contribution Color Graph  (0) 2022.01.28
[Github] Activity Overview 설정  (0) 2022.01.28
[Github] 잔디 먹는 뱀 만들기  (0) 2022.01.01
코딩테스트/Programmers/ [Leet Code SQL] 180. Consecutive Numbers
2022-01-28 04:46:46
반응형

Consecutive Numbers

 

 문제 설명

 

Table: Logs

+-------------+---------+
| Column Name | Type    |
+-------------+---------+
| id          | int     |
| num         | varchar |
+-------------+---------+
id is the primary key for this table.

 

Write an SQL query to find all numbers that appear at least three times consecutively.

Return the result table in any order.

The query result format is in the following example.

 

 입출력 예

 

Example 1:

Input: 
Logs table:
+----+-----+
| id | num |
+----+-----+
| 1  | 1   |
| 2  | 1   |
| 3  | 1   |
| 4  | 2   |
| 5  | 1   |
| 6  | 2   |
| 7  | 2   |
+----+-----+
Output: 
+-----------------+
| ConsecutiveNums |
+-----------------+
| 1               |
+-----------------+
Explanation: 1 is the only number that appears consecutively for at least three times.

 

 Oracle Query

 

SELECT DISTINCT 
	l1.Num As ConsecutiveNums
FROM Logs l1
JOIN Logs l2 ON l1.Id = l2.Id-1
JOIN Logs l3 ON l2.Id = l3.Id-1
WHERE l1.Num = l2.Num
	AND l2.Num = l3.Num;

* 참고 링크 : https://leetcode.com/problems/consecutive-numbers/discuss/185886/Self-Join-Twice-(681-ms-faster-than-100.00-of-Oracle-online-submissions-for-Consecutive-Numbers.)

 

 출처

 

https://leetcode.com/problems/consecutive-numbers/

반응형

'코딩테스트 > Programmers' 카테고리의 다른 글

[코딩테스트/Programmers] 26. 배달  (0) 2022.03.09
[Leet Code] 611. Valid Triangle Number  (0) 2022.01.28
[Leet Code] 162. Find Peak Element  (0) 2022.01.28
[Leet Code] 374. Guess Number Higher or Lower  (0) 2022.01.28
[코딩테스트/Programmers] 25_소수찾기 (Lv2.)  (0) 2022.01.25
코딩테스트/Programmers/ [Leet Code] 611. Valid Triangle Number
2022-01-28 04:23:15
반응형

Valid Triangle Number

 

 문제 설명

 

Given an integer array nums, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle.

 

 제한 사항

 

  • 1 <= nums.length <= 1000
  • 0 <= nums[i] <= 1000

 

 입출력 예

 

Example 1:

Input: nums = [2,2,3,4]
Output: 3
Explanation: Valid combinations are: 
2,3,4 (using the first 2)
2,3,4 (using the second 2)
2,2,3

Example 2:

Input: nums = [4,2,3,4]
Output: 4

 

 Python 코드

 

Python code 

class Solution(object):
    def triangleNumber(self, nums):

        nums, count, n = sorted(nums, reverse=1), 0, len(nums)
        for i in range(n):
            j, k = i + 1, n - 1
            while j < k:
                if nums[j] + nums[k] > nums[i]:
                    count += k - j
                    j += 1
                else:
                    k -= 1
        return count

* 참고 링크 : https://leetcode.com/problems/valid-triangle-number/discuss/104177/O(N2)-solution-for-C%2B%2B-and-Python

 

 C++ 코드

 

C ++ code

class Solution {
public:
    int triangleNumber(vector<int>& nums) {
        if(nums.size() < 3) return 0;
        sort(nums.begin(), nums.end(), greater<int>());
        int res = 0;
        int n = nums.size();
        for(int a = 0; a < n-2; ++a){
            int b = a+1;
            int c = n-1;
            while(b < c){
                if(nums[b] + nums[c] > nums[a]){
                    res = res + c - b;
                    ++b;
                }
                else
                    --c;
            }
        }
        return res;
    }
};

* 참고 링크 : https://www.programmerall.com/article/1415760413/

 

 출처

 

https://leetcode.com/problems/valid-triangle-number/

반응형

'코딩테스트 > Programmers' 카테고리의 다른 글

[코딩테스트/Programmers] 26. 배달  (0) 2022.03.09
[Leet Code SQL] 180. Consecutive Numbers  (0) 2022.01.28
[Leet Code] 162. Find Peak Element  (0) 2022.01.28
[Leet Code] 374. Guess Number Higher or Lower  (0) 2022.01.28
[코딩테스트/Programmers] 25_소수찾기 (Lv2.)  (0) 2022.01.25

티스토리툴바