황트루치
Hello KyoBin, Ready for a change? Please meet IntelliJ IDEA 2018.1 – our first major update of this year! This new release brings with it significant improvements to supported languages, frameworks, version...
<!– https://mvnrepository.com/artifact/com.google.guava/guava –> <dependency> <groupId>com.google.guava</groupId> <artifactId>guava</artifactId> <version>24.0-jre</version> </dependency> List<OnlineMenuVO> selectMenu2List = this.uiMainService.selectMenu2List(this.custCoCd); Predicate<OnlineMenuVO> lvl1ListPredicate = new Predicate<OnlineMenuVO>() { @Override public boolean apply(@Nullable OnlineMenuVO onlineMenuVO) { if(onlineMenuVO.getClsLvl() == 1){ return true;...
바이너리 트리 레벨선회 구현하기 Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 /...
바이너리 트리 후위선회 구현하기 Given a binary tree, return the postorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [3,2,1]. Note: Recursive solution is trivial,...
바이너리 트리 중위순회 구현하기 Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. Note: Recursive solution is trivial, could...
바이너리 트리에서 전위순회 구현해보기 Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could...
public class mainClass { public static void main(String[] args){ ArrayList arrayList = new ArrayList(); arrayList.add(“10”); arrayList.add(“20”); arrayList.add(“30”); System.out.println(arrayList.getSize()); System.out.println(arrayList.toString()); //arrayList.indexOf(2); arrayList.addIndex(1, “15”); System.out.println(arrayList.toString()); arrayList.remove(2); System.out.println(arrayList.toString()); } } public class...
주어진 문자를 역순으로 반환하는 작성하라 Write a function that takes a string as input and returns the string reversed. Example: Given s = “hello”, return “olleh”. class Solution { public...
asc로 정렬된 Integer배열에서 지정된 범위의 target Value를 찾아라 알고리즘의 복잡도는 O(log n)이어야 하며, target Value를 찾지 못하면 [-1, -1]을 반환한다. Given an array of integers sorted in ascending order, find...
정렬된 Array에서 중복제거하여 target의 인덱스 반환하기 1. ArrayList에 데이터 셋팅. 2. 중복이 허용되지 않는 HashSet에 데이터 셋팅. 3. 다시 int[]에 담아 반환 class Solution { public int[] searchRange(int[] nums, int...
More
최근 댓글