🎨 add time complexity

dalpang81 · dalpang81 · commit 8e56bb812338 · 2024-12-14T02:53:53.000+09:00
diff --git a/contains-duplicate/dalpang81.java b/contains-duplicate/dalpang81.java
@@ -1,3 +1,4 @@
+//시간복잡도 : O(nlogn)
 class Solution {
     public boolean containsDuplicate(int[] nums) {
         Arrays.sort(nums);
diff --git a/house-robber/dalpang81.java b/house-robber/dalpang81.java
@@ -1,3 +1,4 @@
+//시간복잡도 O(n)
 class Solution {
     public int rob(int[] nums) {
         if (nums.length == 1) {
diff --git a/longest-consecutive-sequence/dalpang81.java b/longest-consecutive-sequence/dalpang81.java
@@ -1,3 +1,4 @@
+//시간복잡도: O(n)
 import java.util.*;
 
 class Solution {
diff --git a/top-k-frequent-elements/dalpang81.java b/top-k-frequent-elements/dalpang81.java
@@ -1,3 +1,4 @@
+//시간복잡도: O(n + mlogk)
 import java.util.*;
 class Solution {
     public int[] topKFrequent(int[] nums, int k) {
diff --git a/valid-palindrome/dalpang81.java b/valid-palindrome/dalpang81.java
@@ -1,3 +1,4 @@
+//시간복잡도: O(n)
 class Solution {
     public boolean isPalindrome(String s) {
         s = s.toLowerCase().trim();

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+//시간복잡도 : O(nlogn)`
`1`	`2`	`class Solution {`
`2`	`3`	`public boolean containsDuplicate(int[] nums) {`
`3`	`4`	`Arrays.sort(nums);`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,4 @@`
	`1`	`+//시간복잡도: O(n + mlogk)`
`1`	`2`	`import java.util.*;`
`2`	`3`	`class Solution {`
`3`	`4`	`public int[] topKFrequent(int[] nums, int k) {`