update ref

Author: geemaple

lintcode/434.number-of-islands-ii.cpp

@@ -2,7 +2,7 @@
 //  Time: O(K)
 //  Space: O(NM + K)
 //  Ref: -
-//  Note: leetcode-305
+//  Note: Leetcode-305
 
 //  Given a n,m which means the row and column of the 2D matrix and an array of pair A( size k).
 //  Originally, the 2D matrix is all 0 which means there is only sea in the matrix.

lintcode/434.number-of-islands-ii.py

@@ -2,7 +2,7 @@
 #  Time: O(K)
 #  Space: O(NM + K)
 #  Ref: -
-#  Note: leetcode-305
+#  Note: Leetcode-305
 
 #  Given a n,m which means the row and column of the 2D matrix and an array of pair A( size k).
 #  Originally, the 2D matrix is all 0 which means there is only sea in the matrix.

lintcode/919.meeting-rooms-ii.cpp

@@ -1,7 +1,7 @@
 //  Tag: Heap, Greedy, Sweep Line, Sort
 //  Time: O(NlogN)
 //  Space: O(N)
-//  Ref: leetcode-253
+//  Ref: Leetcode-253
 //  Note: -
 
 //  Given an array of meeting time intervals consisting of start and end times `[[s1,e1],[s2,e2],...] (si < ei)`, find the minimum number of conference rooms required.

lintcode/919.meeting-rooms-ii.py

@@ -1,7 +1,7 @@
 #  Tag: Heap, Greedy, Sweep Line, Sort
 #  Time: O(NlogN)
 #  Space: O(N)
-#  Ref: leetcode-253
+#  Ref: Leetcode-253
 #  Note: -
 
 #  Given an array of meeting time intervals consisting of start and end times `[[s1,e1],[s2,e2],...] (si < ei)`, find the minimum number of conference rooms required.