链表

Author: wb-hjk570755

src/com/blankj/myself/HammingWeight.java

@@ -0,0 +1,23 @@
+package com.blankj.myself;
+
+/**
+ * Description:
+ * Copyright: Copyright (c) 2012
+ * Company: keruyun Technology(Beijing) Chengdu Co. Ltd.
+ *
+ * @author huangjk
+ * @version 1.0 2020/10/2
+ */
+public class HammingWeight {
+
+    public int hammingWeight(int n) {
+        int res = 0;
+        while(n != 0) {
+            res += n & 1;
+            n >>>= 1;
+        }
+        return res;
+
+
+    }
+}

src/com/blankj/myself/HasCycle_fast_slow_point.java

@@ -31,10 +31,10 @@ public boolean hasCycle(ListNode head) {
         return false;
     }
 
-    class ListNode {
+    static class ListNode {
       int val;
       ListNode next;
-      ListNode(int x) {
+      public ListNode(int x) {
           val = x;
           next = null;
       }

src/com/blankj/myself/KthLargest.java

@@ -0,0 +1,34 @@
+package com.blankj.myself;
+
+import com.blankj.myself.InorderTraversal.TreeNode;
+
+/**
+ * Description:
+ * Copyright: Copyright (c) 2012
+ * Company: keruyun Technology(Beijing) Chengdu Co. Ltd.
+ *
+ * @author huangjk
+ * @version 1.0 2020/10/2
+ */
+public class KthLargest {
+
+    int resp;
+    int index;
+    public int kthLargest(TreeNode root, int k) {
+        index = k;
+         dfs(root);
+         return resp;
+    }
+
+    public void dfs(TreeNode root){
+        if(root==null){
+            return ;
+        }
+        dfs(root.right);
+
+        if(--index==0){
+            resp = root.val;
+        }
+        dfs(root.left);
+    }
+}

src/com/blankj/myself/ReverseList.java

@@ -0,0 +1,30 @@
+package com.blankj.myself;
+
+import java.util.Stack;
+
+import com.blankj.myself.HasCycle_fast_slow_point.ListNode;
+
+/**
+ * Description:
+ * Copyright: Copyright (c) 2012
+ * Company: keruyun Technology(Beijing) Chengdu Co. Ltd.
+ *
+ * @author huangjk
+ * @version 1.0 2020/10/2
+ */
+public class ReverseList {
+
+    public ListNode reverseList(ListNode head) {
+        Stack<Integer> stack = new Stack();
+        while(head!=null){
+            stack.push(head.val);
+            head = head.next;
+        }
+        ListNode listNode = new ListNode(stack.pop().intValue());
+        while(!stack.isEmpty()){
+            listNode.next = new ListNode(stack.pop().intValue());
+        }
+        return listNode;
+    }
+
+}

src/com/blankj/myself/Rotate.java

@@ -0,0 +1,45 @@
+package com.blankj.myself;
+
+/**
+ * Description:
+ * Copyright: Copyright (c) 2012
+ * Company: keruyun Technology(Beijing) Chengdu Co. Ltd.
+ *
+ * @author huangjk
+ * @version 1.0 2020/10/2
+ */
+public class Rotate {
+
+    public static void main(String[] args) {
+        int[] a = {1,2,3,4,5,6,7};
+        Rotate rotate = new Rotate();
+        rotate.rotate(a,3);
+    }
+
+    public void rotate(int[] nums, int k) {
+
+        for(int i=0;i<k;i++){
+            int temp = nums[nums.length-1];
+            for (int j=nums.length-1;j>=0;j--){
+                if(j==0){
+                    nums[j] = temp;
+                }else{
+                    nums[j] = nums[j-1];
+                }
+            }
+        }
+        //int[] temps = new int[k];
+        //for(int i=nums.length-k;i<=nums.length-1;i++){
+        //    temps[i+k-nums.length]=nums[i];
+        //}
+        //for(int j=nums.length-1;j>=0;j--){
+        //    if(j>=k){
+        //        nums[j]=nums[j-k];
+        //    }else{
+        //        nums[j]=temps[j];
+        //    }
+        //}
+
+    }
+
+}