原创 【筆記】java打包jar之後運行出現中文亂碼

今天調試的時候,在eclipse裏面可以正常顯示中文,但是把工程打成jar之後,在cmd裏面用java -jar 執行的時候,確出現了亂碼。 初步解決的方法是:  java -Dfile.encoding=utf-8 -jar ***

原创 【leetcode】Array——Insert Interval(57)

題目:Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may ass

原创 【leetcode】Array——Contains Duplicate(217)

題目: Given an array of integers, find if the array contains any duplicates. Your function should return true if any val

原创 【Java】Integer的常量池

筆試的時候遇到一個問題: Integer i1 = 127; Integer i2 = 127; Integer i3 = 128; Integer i4 = 128; System.out.println(i1==i2); System

原创 【leetcode】Array——Contains Duplicate II(219)

題目:Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array

原创 【Android安全】初步認識Drozer

首先在手機上安全drozer agent,在電腦上面安全drozer console。 然後使用adb設置轉發端口:adb forward tcp:31415 tcp:31415 然後在手機上打開agent應用程序,並Enable ser

原创 【leetcode】String——Palindrome Pairs(336)

題目: Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenatio

原创 【leetcode】Tree——Symmetric Tree(101)

題目: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this

原创 【leetcode】String——Basic Calculator II (227)

題目: Implement a basic calculator to evaluate a simple expression string. The expression string contains only non-nega

原创 【leetcode】String——Letter Combinations of a Phone Number (17)

題目: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit

原创 【leetcode】String——Longest Valid Parentheses(32)

題目: Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) par

原创 【leetcode】Tree——Binary Tree Level Order Traversal(102)

題目: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level

原创 【leetcode】String——Interleaving String(97)

題目: Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given:s1 = "aabcc",s2

原创 【leetcode】String——Scramble String(87)

題目: Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively

原创 【筆記】Java中 int進行右移運算

寫代碼的時候,使用了int>>> 運算(右移一位,高位補0) 但是遇到一個很奇怪的現象: int i = 123; int j = i >>>32;   這時候j並不是想象中的0,而是123,數值並沒有發生變化。