Counting number of pairs in an integer array
0
$begingroup$
So, I wanted to have the count for number of pairs of same integer there are in an array for which I used a HashMap
Input contains two lines:
Integer n:
Signifies the size of input
Input numbers separated by white space character:
E.g 4 6 6 7 7 8 7 6 4
For the same input,
Expected Output:
3
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class SockMerchant {
public int returnsockArr() {
Scanner sc = new Scanner(System.in);
int arraySize = sc.nextInt();
int sockArr = new int[arraySize];
for(int i = 0;i <= arraySize-1; i++) {
sockArr[i] = sc.nextInt();
}
sc.close();
return sockArr;
}
public int returnCount(Map<String, Object> mapCount) {
int count = 0;
for(String keyName : mapCount.keySet()) {
int value = (int)mapCount.get(keyName);
count = count+(value/2);
}
return count;
}
public int setMapAndReturnCount(int sockArr) {
Map<String, Object> mapCount = new HashMap<String, Object>();
for(int j = 0;j<= sockArr.length-1;j++) {
if(mapCount.containsKey(Integer.toString(sockArr[j]))) {
mapCount.put(Integer.toString(sockArr[j]), (int)mapCount.get(Integer.toString(sockArr[j]))+1);
}
else {
mapCount.put(Integer.toString(sockArr[j]), 1);
}
}
return returnCount(mapCount);
}
public static void main(String args) {
SockMerchant sm = new SockMerchant();
int sockArr = sm.returnsockArr();
int finalCount = sm.setMapAndReturnCount(sockArr);
System.out.println(finalCount);
}
}
I think that I have complicated the solution a bit too much
Is there a better approach to do the same thing?
java beginner array
asked 59 mins ago
Akash SinghAkash Singh
132
$endgroup$
add a comment |
0
$begingroup$
So, I wanted to have the count for number of pairs of same integer there are in an array for which I used a HashMap
Input contains two lines:
Integer n:
Signifies the size of input
Input numbers separated by white space character:
E.g 4 6 6 7 7 8 7 6 4
For the same input,
Expected Output:
3
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class SockMerchant {
public int returnsockArr() {
Scanner sc = new Scanner(System.in);
int arraySize = sc.nextInt();
int sockArr = new int[arraySize];
for(int i = 0;i <= arraySize-1; i++) {
sockArr[i] = sc.nextInt();
}
sc.close();
return sockArr;
}
public int returnCount(Map<String, Object> mapCount) {
int count = 0;
for(String keyName : mapCount.keySet()) {
int value = (int)mapCount.get(keyName);
count = count+(value/2);
}
return count;
}
public int setMapAndReturnCount(int sockArr) {
Map<String, Object> mapCount = new HashMap<String, Object>();
for(int j = 0;j<= sockArr.length-1;j++) {
if(mapCount.containsKey(Integer.toString(sockArr[j]))) {
mapCount.put(Integer.toString(sockArr[j]), (int)mapCount.get(Integer.toString(sockArr[j]))+1);
}
else {
mapCount.put(Integer.toString(sockArr[j]), 1);
}
}
return returnCount(mapCount);
}
public static void main(String args) {
SockMerchant sm = new SockMerchant();
int sockArr = sm.returnsockArr();
int finalCount = sm.setMapAndReturnCount(sockArr);
System.out.println(finalCount);
}
}
I think that I have complicated the solution a bit too much
Is there a better approach to do the same thing?
java beginner array
asked 59 mins ago
Akash SinghAkash Singh
132
$endgroup$
add a comment |
0
0
0
$begingroup$
So, I wanted to have the count for number of pairs of same integer there are in an array for which I used a HashMap
Input contains two lines:
Integer n:
Signifies the size of input
Input numbers separated by white space character:
E.g 4 6 6 7 7 8 7 6 4
For the same input,
Expected Output:
3
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class SockMerchant {
public int returnsockArr() {
Scanner sc = new Scanner(System.in);
int arraySize = sc.nextInt();
int sockArr = new int[arraySize];
for(int i = 0;i <= arraySize-1; i++) {
sockArr[i] = sc.nextInt();
}
sc.close();
return sockArr;
}
public int returnCount(Map<String, Object> mapCount) {
int count = 0;
for(String keyName : mapCount.keySet()) {
int value = (int)mapCount.get(keyName);
count = count+(value/2);
}
return count;
}
public int setMapAndReturnCount(int sockArr) {
Map<String, Object> mapCount = new HashMap<String, Object>();
for(int j = 0;j<= sockArr.length-1;j++) {
if(mapCount.containsKey(Integer.toString(sockArr[j]))) {
mapCount.put(Integer.toString(sockArr[j]), (int)mapCount.get(Integer.toString(sockArr[j]))+1);
}
else {
mapCount.put(Integer.toString(sockArr[j]), 1);
}
}
return returnCount(mapCount);
}
public static void main(String args) {
SockMerchant sm = new SockMerchant();
int sockArr = sm.returnsockArr();
int finalCount = sm.setMapAndReturnCount(sockArr);
System.out.println(finalCount);
}
}
I think that I have complicated the solution a bit too much
Is there a better approach to do the same thing?
java beginner array
asked 59 mins ago
Akash SinghAkash Singh
132
$endgroup$
So, I wanted to have the count for number of pairs of same integer there are in an array for which I used a HashMap
Input contains two lines:
Integer n:
Signifies the size of input
Input numbers separated by white space character:
E.g 4 6 6 7 7 8 7 6 4
For the same input,
Expected Output:
3
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class SockMerchant {
public int returnsockArr() {
Scanner sc = new Scanner(System.in);
int arraySize = sc.nextInt();
int sockArr = new int[arraySize];
for(int i = 0;i <= arraySize-1; i++) {
sockArr[i] = sc.nextInt();
}
sc.close();
return sockArr;
}
public int returnCount(Map<String, Object> mapCount) {
int count = 0;
for(String keyName : mapCount.keySet()) {
int value = (int)mapCount.get(keyName);
count = count+(value/2);
}
return count;
}
public int setMapAndReturnCount(int sockArr) {
Map<String, Object> mapCount = new HashMap<String, Object>();
for(int j = 0;j<= sockArr.length-1;j++) {
if(mapCount.containsKey(Integer.toString(sockArr[j]))) {
mapCount.put(Integer.toString(sockArr[j]), (int)mapCount.get(Integer.toString(sockArr[j]))+1);
}
else {
mapCount.put(Integer.toString(sockArr[j]), 1);
}
}
return returnCount(mapCount);
}
public static void main(String args) {
SockMerchant sm = new SockMerchant();
int sockArr = sm.returnsockArr();
int finalCount = sm.setMapAndReturnCount(sockArr);
System.out.println(finalCount);
}
}
I think that I have complicated the solution a bit too much
Is there a better approach to do the same thing?
java beginner array
java beginner array
asked 59 mins ago
Akash SinghAkash Singh
132
asked 59 mins ago
Akash SinghAkash Singh
132
asked 59 mins ago
Akash SinghAkash Singh
132
asked 59 mins ago
Akash SinghAkash Singh
132
asked 59 mins ago
Akash SinghAkash Singh
132
132
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f211537%2fcounting-number-of-pairs-in-an-integer-array%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f211537%2fcounting-number-of-pairs-in-an-integer-array%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
