6/6

Author: sc-yan

Java/Array/12-Element Appearing More Than 25% In Sorted Array.java

@@ -0,0 +1,50 @@
+Easy Leetcode 1287
+tags: Array
+
+方法1:
+题目不难。最直观的解法 计算出现的次数
+方法2：
+非常巧妙的方法，更巧妙的计算次数
+方法3
+采用二分法。
+
+
+
+```
+
+/*
+方法1
+*/
+class Solution {
+    public int findSpecialInteger(int[] arr) {
+        if(arr.length == 1) {
+            return arr[0];
+        }
+        int len = 1; 
+        for (int i = 0; i < arr.length; i++) {
+            if(arr[i] == arr[i+1]) {
+                len++;
+                if(len > arr.length/4) {
+                    return arr[i];
+                }
+            }else{
+                len = 1;
+            }
+        }
+        return 1;
+    }
+}
+
+/*
+方法2
+*/
+    public int findSpecialInteger(int[] arr) {
+        int n = arr.length, t = n / 4;
+
+        for (int i = 0; i < n - t; i++) {
+            if (arr[i] == arr[i + t]) {
+                return arr[i];
+            }
+        }
+        return -1;
+    }

README.md

@@ -1,24 +1,12 @@
+
 # leetcode-journey
-my journey to leetcode solutions
 
-### ff
 
-**README.md**: 所有所做过的题目
+here I write down every problem I solved with my initial thought and second thoughts after reviewing many brilliant solutions proposed in the discussion section.
 
+172/1469 Solved 
+ Easy 167
+ Medium 4
+ Hard 1
 
-| Squence | Problem       | Level  | Language  | Tags |      Note     |
-|:-------:|:--------------|:------:|:---------:|:----:|:-------------:|
-|0|[Two Sum.java](https://github.com/u4989190/LintCode/blob/master/Java/0-Two%20Sum.java)|Easy|Java|[ss]||
-|1|[Reverse Integer.java](https://github.com/u4989190/LintCode/blob/master/Java/1-Reverse%20Integer.java)|Easy|Java|[]||
-|2|[Palindrome Number.java](https://github.com/u4989190/LintCode/blob/master/Java/2-Palindrome%20Number.java)|Easy|Java|[ss]||
-|3|[Roman to Integer.java](https://github.com/u4989190/LintCode/blob/master/Java/0-Two%20Sum.java)|Easy|Java|[ss]||
-|4|[Loggest Common Prefix.java](https://github.com/u4989190/LintCode/blob/master/Java/0-Two%20Sum.java)|Easy|Java|[ss]||
-|5|[Valid Parentheses.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[String]||
-|6|[Merge Two Sorted Lists.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[Linked List]||
-|7|[Implement sStringtrStr().java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[]||
-|8|[Count and Say.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[String]||
-|9|[Length of Last Word.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[String]||
-|10|[Valid Palindrome.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[String]||
-|12|[Reverse Vowels of a String.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[String]||
-|13|[Ransom Note.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[String]||
-|14|[First Unique Character in a String.java](https://github.com/u4989190/LintCode/blob/master/Java/5-Valid%20Parentheses.java)|Easy|Java|[String]||
+[my leetcode account page](https://leetcode.com/u4989190/)