
์ขํ๋ฏธ์ ์ ์งํํ๋ค ํท๊ฐ๋ ค์ ๋ ธ๊ฐ๋ค๋ก ์ง์ ๊ฐ ๋ณํ๋ฅผ ํ์ธํด๋ณด๊ธฐ๋ก ํ๋ค. Shallow Copy vs Deep Copy ๋จผ์ 3๊ฐ์ง์ ๋ณต์ฌ ๋ฐฉ๋ฒ ๋น๊ต ๋งํฌ๋ฅผ ์ฐธ์กฐํ, ์์๋ณต์ฌ/๊น์๋ณต์ฌ/๋๊น์๋ณต์ฌ public static void main(String[] args) { test1(); test2(); test3(); } private static void test1() { List origin = new ArrayList(); origin.add(new Car("k5")); origin.add(new Car("k9")); List copy = origin; origin.add(new Car("sonata")); copy.add(new Car("avante")); origin.get(0).setName("s..
General, Java
2019. 9. 14. 15:12
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- Today
- Yesterday
TAG
- Stack
- ํ๋ก๊ทธ๋๋จธ์ค
- queue
- ํ๊ณ
- Vo
- Data Structure
- OneToMany
- sort
- mysql
- C
- ์ฐ์ํ ํ ํฌ์ฝ์ค
- Android Studio
- Java
- ์นํดํน
- Android
- webhacking.kr
- ํด์ธ์ฌํ
- reversing
- ๋ฆฌ๋ฒ์ฑ
- ๊ฐ๋ฐ์
- JPA
- javascript
- socket
- Algorithm
- FRAGMENT
- bfs
- graph
- brute-force
- dfs
- git
์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |
๊ธ ๋ณด๊ดํจ