First, write a function class Solution { public int solution(int[] A); }that, given a zero-indexed array A consisting of N integers, returns the number of distinct values in array A. For example, given array A consisting of six elements such that:A[0] = 5 A[1] = 1 A[2] = 1 A[3] = 5 A[4] = 7 A[5] = 1the function should return 3, because there are 3 distinct values appearing in array A, namely 1, ..
Write a Java program to answer about the statistical information such as arithmetic mean, median, mode, and standard deviation of an integer data set. (The arithmetic median, median, and mode mean that the arithmetic average, mid-point of the distribution, and most frequent response, respectively.) The input data can be generated by random method or keyboard. Your program should display the outp..
코드 package assignment; import java.util.*; public class Assignment { public static int xx; public static int yy; public static void main(String[] args) { char [][] boggle = new char[5][5]; char[][] cp_array = new char[5][5]; init_boggle(boggle); print_boggle(boggle); while(true) { System.out.print("Input word: "); var scanner = new Scanner(System.in); String input_word = scanner.next(); if (!wor..
//문제정수 배열(int array)가 주어지면 가장 큰 이어지는 원소들의 합을 구하시오. 단, 시간복잡도는 O(n). //예제Input: [-1, 3, -1, 5]Output: 7 // 3 + (-1) + 5 Input: [-5, -3, -1]Output: -1 // -1 Input: [2, 4, -2, -3, 8]Output: 9 // 2 + 4 + (-2) + (-3) + 8 //코딩//// main.c// program//// Created by Eon on 7/26/18.// Copyright © 2018 Eonseok Yim. All rights reserved.// #include int math_max(int a, int b) { if (a < b) { return b; } else ret..
- Total
- Today
- Yesterday
- Vega64
- 우분투
- 문제
- 외장그래픽
- 코드업
- 알고리즘
- python
- 맥
- 환경오염
- 프로그래밍
- 맥북
- 이클립스
- 아키티오
- eclipse
- NAS
- 개발
- se846
- 산업화
- C++
- 파이썬
- 자바
- Java
- 코딩
- CodeUp
- 슈어
- egpu
- 모바일 프로그래밍
- 서버
- 백준
- 카카오톡
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 |