Giter Site home page Giter Site logo

prgrms-web-devcourse / be-team-f-study2 Goto Github PK

View Code? Open in Web Editor NEW
0.0 0.0 2.0 604 KB

백엔드F - Tyler의 추종자들

Home Page: https://prgrms-web-devcourse.github.io/be-team-f-study2/

License: MIT License

HTML 35.59% Ruby 0.52% JavaScript 22.71% SCSS 41.18%

be-team-f-study2's People

Contributors

0923kdh avatar dongsubkim avatar hanjo8813 avatar jummi10 avatar kwhyo avatar mentor-tyler avatar

Forkers

iyj6707 0923kdh

be-team-f-study2's Issues

08/13 코테 스터디

https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/

1769. Minimum Number of Operations to Move All Balls to Each Box

You have n boxes. You are given a binary string boxes of length n, where boxes[i] is '0' if the ith box is empty, and '1' if it contains one ball.

In one operation, you can move one ball from a box to an adjacent box. Box i is adjacent to box j if abs(i - j) == 1. Note that after doing so, there may be more than one ball in some boxes.

Return an array answer of size n, where answer[i] is the minimum number of operations needed to move all the balls to the ith box.

Each answer[i] is calculated considering the initial state of the boxes.

 

Example 1:

Input: boxes = "110"
Output: [1,1,3]
Explanation: The answer for each box is as follows:
1) First box: you will have to move one ball from the second box to the first box in one operation.
2) Second box: you will have to move one ball from the first box to the second box in one operation.
3) Third box: you will have to move one ball from the first box to the third box in two operations, and move one ball from the second box to the third box in one operation.

Example 2:

Input: boxes = "001011"
Output: [11,8,5,4,3,4]

 

Constraints:

  • n == boxes.length
  • 1 <= n <= 2000
  • boxes[i] is either '0' or '1'.

우리만의 컨벤션(?)

파일명 규칙

  • _posts 폴더에 md파일을 작성하면 포스트가 자동으로 추가됩니다.
  • 파일명은 반드시 날짜를 앞에 붙여줘야 하고, merge시 충돌 방지를 위해 디자인패턴명으로 작성합니다.

파일명 예시

2021-08-10-FactoryMethod.md

md 내용 규칙

  • md 내용 작성시 반드시 상단에 일정한 형식이 존재해야 합니다.
  • 제목은 자유롭게 써도 되지만 tags는 필터링(?)에 사용되므로 반드시 정해진 태그만 사용하도록 해요~
    • (가독성 좋게 한글로 하겠읍니다) 디자인패턴, 생성패턴, 구조패턴, 행위패턴
  • <!--more--> 태그의 윗 부분은 썸네일 요약에 들어가는 부분이니까 짧게 작성해야 합니다!
  • md파일이 어떻게 렌더링되는지 궁금하다면? => 공식사이트 테마소개

md 내용 예시

---
title: 팩토리 패턴에 대해 알아보자!
tags:
  - 디자인패턴
  - 생성패턴
---
// 짧게 설명 or 작성자 명시
<!--more-->
// 아래에서 자유롭게 작성

브랜치 규칙

  • github page는 main 브랜치 내용만을 호스팅합니다.
  • 따라서 수정사항이 반영되려면 반드시 main 브랜치로의 merge or PR 이 필수적입니다.
  • 작업은 각자 브랜치를 파서 하고 완료되면 반드시 main 브랜치에 merge 해주세요!
  • 브랜치명은 각자 이름으로 생성하고, 만약 서브 브랜치를 쓴다면 한재원_factory 이런식으로 하는게 어떨까요?

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.